./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 44c38e66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/weaver/popl20-more-sum-array-hom.wvr.c -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 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a --- Real Ultimate output --- This is Ultimate 0.3.0-?-44c38e6-m [2025-04-24 20:21:47,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-24 20:21:47,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-24 20:21:47,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-24 20:21:47,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-24 20:21:47,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-24 20:21:47,239 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-24 20:21:47,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-24 20:21:47,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-24 20:21:47,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-24 20:21:47,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-24 20:21:47,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-24 20:21:47,241 INFO L153 SettingsManager]: * Use SBE=true [2025-04-24 20:21:47,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-24 20:21:47,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-24 20:21:47,242 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-24 20:21:47,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-24 20:21:47,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-24 20:21:47,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-24 20:21:47,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-24 20:21:47,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-24 20:21:47,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-24 20:21:47,242 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-24 20:21:47,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-24 20:21:47,242 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-24 20:21:47,243 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-24 20:21:47,243 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-24 20:21:47,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 20:21:47,243 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 20:21:47,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 20:21:47,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 20:21:47,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-24 20:21:47,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 20:21:47,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 20:21:47,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 20:21:47,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 20:21:47,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-24 20:21:47,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-24 20:21:47,244 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-24 20:21:47,244 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-24 20:21:47,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-24 20:21:47,244 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-24 20:21:47,244 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-24 20:21:47,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-24 20:21:47,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-24 20:21:47,245 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-24 20:21:47,245 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-24 20:21:47,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a [2025-04-24 20:21:47,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-24 20:21:47,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-24 20:21:47,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-24 20:21:47,470 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-24 20:21:47,470 INFO L274 PluginConnector]: CDTParser initialized [2025-04-24 20:21:47,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2025-04-24 20:21:48,779 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/71aab49bc/6686b77baca44b478ec94c36b4173dd8/FLAG2c2c4d569 [2025-04-24 20:21:48,956 INFO L389 CDTParser]: Found 1 translation units. [2025-04-24 20:21:48,957 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2025-04-24 20:21:48,965 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/71aab49bc/6686b77baca44b478ec94c36b4173dd8/FLAG2c2c4d569 [2025-04-24 20:21:49,830 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/71aab49bc/6686b77baca44b478ec94c36b4173dd8 [2025-04-24 20:21:49,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-24 20:21:49,833 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-24 20:21:49,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-24 20:21:49,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-24 20:21:49,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-24 20:21:49,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 08:21:49" (1/1) ... [2025-04-24 20:21:49,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f8de8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:21:49, skipping insertion in model container [2025-04-24 20:21:49,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 08:21:49" (1/1) ... [2025-04-24 20:21:49,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-24 20:21:50,000 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c[2435,2448] [2025-04-24 20:21:50,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 20:21:50,021 INFO L200 MainTranslator]: Completed pre-run [2025-04-24 20:21:50,051 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c[2435,2448] [2025-04-24 20:21:50,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 20:21:50,067 INFO L204 MainTranslator]: Completed translation [2025-04-24 20:21:50,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:21:50 WrapperNode [2025-04-24 20:21:50,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-24 20:21:50,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-24 20:21:50,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-24 20:21:50,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-24 20:21:50,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:21:50" (1/1) ... [2025-04-24 20:21:50,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:21:50" (1/1) ... [2025-04-24 20:21:50,103 INFO L138 Inliner]: procedures = 24, calls = 19, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 84 [2025-04-24 20:21:50,105 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-24 20:21:50,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-24 20:21:50,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-24 20:21:50,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-24 20:21:50,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:21:50" (1/1) ... [2025-04-24 20:21:50,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:21:50" (1/1) ... [2025-04-24 20:21:50,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:21:50" (1/1) ... [2025-04-24 20:21:50,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:21:50" (1/1) ... [2025-04-24 20:21:50,122 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:21:50" (1/1) ... [2025-04-24 20:21:50,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:21:50" (1/1) ... [2025-04-24 20:21:50,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:21:50" (1/1) ... [2025-04-24 20:21:50,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:21:50" (1/1) ... [2025-04-24 20:21:50,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:21:50" (1/1) ... [2025-04-24 20:21:50,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-24 20:21:50,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-24 20:21:50,138 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-24 20:21:50,138 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-24 20:21:50,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:21:50" (1/1) ... [2025-04-24 20:21:50,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 20:21:50,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:21:50,161 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-24 20:21:50,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-24 20:21:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-24 20:21:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-24 20:21:50,178 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-24 20:21:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-24 20:21:50,178 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-24 20:21:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-24 20:21:50,179 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-24 20:21:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-24 20:21:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-24 20:21:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-24 20:21:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-24 20:21:50,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-24 20:21:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-24 20:21:50,180 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-24 20:21:50,255 INFO L234 CfgBuilder]: Building ICFG [2025-04-24 20:21:50,256 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-24 20:21:50,448 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-24 20:21:50,451 INFO L283 CfgBuilder]: Performing block encoding [2025-04-24 20:21:50,587 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-24 20:21:50,587 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-24 20:21:50,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 08:21:50 BoogieIcfgContainer [2025-04-24 20:21:50,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-24 20:21:50,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-24 20:21:50,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-24 20:21:50,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-24 20:21:50,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.04 08:21:49" (1/3) ... [2025-04-24 20:21:50,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2310f955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 08:21:50, skipping insertion in model container [2025-04-24 20:21:50,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:21:50" (2/3) ... [2025-04-24 20:21:50,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2310f955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 08:21:50, skipping insertion in model container [2025-04-24 20:21:50,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 08:21:50" (3/3) ... [2025-04-24 20:21:50,595 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2025-04-24 20:21:50,604 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-24 20:21:50,606 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-sum-array-hom.wvr.c that has 4 procedures, 24 locations, 24 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-24 20:21:50,606 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-24 20:21:50,646 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-24 20:21:50,680 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 20:21:50,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-24 20:21:50,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:21:50,683 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) [2025-04-24 20:21:50,685 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 [2025-04-24 20:21:50,753 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 20:21:50,766 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 20:21:50,773 INFO L340 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;@33373fb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 20:21:50,774 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-24 20:21:50,996 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:21:50,996 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:21:50,996 INFO L139 ounterexampleChecker]: Examining path program with hash -993870185, occurence #1 [2025-04-24 20:21:50,996 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:21:50,996 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:21:50,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:21:51,000 INFO L85 PathProgramCache]: Analyzing trace with hash -368705343, now seen corresponding path program 1 times [2025-04-24 20:21:51,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:21:51,005 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227302325] [2025-04-24 20:21:51,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:21:51,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:21:51,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-24 20:21:51,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-24 20:21:51,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:21:51,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:21:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:21:51,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:21:51,368 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227302325] [2025-04-24 20:21:51,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227302325] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:21:51,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:21:51,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 20:21:51,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438827610] [2025-04-24 20:21:51,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:21:51,373 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 20:21:51,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:21:51,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 20:21:51,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-24 20:21:51,389 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:21:51,390 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:21:51,392 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 20:21:51,392 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:21:51,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:21:51,461 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-24 20:21:51,461 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:21:51,461 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:21:51,461 INFO L139 ounterexampleChecker]: Examining path program with hash -993870185, occurence #2 [2025-04-24 20:21:51,461 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:21:51,462 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 20:21:51,462 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:21:51,462 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-24 20:21:51,472 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:21:51,473 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-24 20:21:51,473 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:21:51,473 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-24 20:21:51,473 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:21:51,473 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 18 [2025-04-24 20:21:51,474 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:21:51,474 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 21 [2025-04-24 20:21:51,474 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:21:51,474 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:21:51,474 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:21:51,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:21:51,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1980746140, now seen corresponding path program 1 times [2025-04-24 20:21:51,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:21:51,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428535429] [2025-04-24 20:21:51,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:21:51,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:21:51,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-24 20:21:51,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-24 20:21:51,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:21:51,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:21:51,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:21:51,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:21:51,663 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428535429] [2025-04-24 20:21:51,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428535429] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:21:51,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116062314] [2025-04-24 20:21:51,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:21:51,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:21:51,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:21:51,666 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) [2025-04-24 20:21:51,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-24 20:21:51,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-24 20:21:51,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-24 20:21:51,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:21:51,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:21:51,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-24 20:21:51,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:21:51,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:21:51,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:21:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:21:51,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116062314] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:21:51,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 20:21:51,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-24 20:21:51,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509991859] [2025-04-24 20:21:51,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 20:21:51,922 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-24 20:21:51,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:21:51,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-24 20:21:51,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-04-24 20:21:51,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:21:51,924 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:21:51,925 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 20:21:51,925 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:21:51,925 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:21:52,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:21:52,033 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:21:52,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-24 20:21:52,237 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-04-24 20:21:52,237 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:21:52,237 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:21:52,237 INFO L139 ounterexampleChecker]: Examining path program with hash -993870185, occurence #3 [2025-04-24 20:21:52,237 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:21:52,237 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 20:21:52,237 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:21:52,237 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 20:21:52,238 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:21:52,238 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 20:21:52,238 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:21:52,238 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 20:21:52,238 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:21:52,238 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-04-24 20:21:52,238 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:21:52,238 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 22 [2025-04-24 20:21:52,238 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:21:52,238 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:21:52,238 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:21:52,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:21:52,239 INFO L85 PathProgramCache]: Analyzing trace with hash -414403295, now seen corresponding path program 2 times [2025-04-24 20:21:52,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:21:52,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831790338] [2025-04-24 20:21:52,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 20:21:52,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:21:52,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-24 20:21:52,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 24 statements. [2025-04-24 20:21:52,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 20:21:52,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:21:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:21:52,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:21:52,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831790338] [2025-04-24 20:21:52,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831790338] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:21:52,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:21:52,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-24 20:21:52,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751326391] [2025-04-24 20:21:52,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:21:52,397 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-24 20:21:52,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:21:52,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-24 20:21:52,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-24 20:21:52,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:21:52,398 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:21:52,398 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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) [2025-04-24 20:21:52,398 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:21:52,398 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:21:52,398 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:21:52,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:21:52,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:21:52,522 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-24 20:21:52,522 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-24 20:21:52,522 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:21:52,522 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:21:52,522 INFO L139 ounterexampleChecker]: Examining path program with hash -993870185, occurence #4 [2025-04-24 20:21:52,522 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:21:52,522 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 20:21:52,522 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:21:52,522 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 20:21:52,522 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:21:52,522 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 20:21:52,522 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:21:52,522 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 20:21:52,522 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:21:52,522 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 22 [2025-04-24 20:21:52,522 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:21:52,523 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-24 20:21:52,523 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:21:52,523 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:21:52,523 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:21:52,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:21:52,523 INFO L85 PathProgramCache]: Analyzing trace with hash 152500462, now seen corresponding path program 1 times [2025-04-24 20:21:52,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:21:52,523 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869135789] [2025-04-24 20:21:52,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:21:52,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:21:52,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-24 20:21:52,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-24 20:21:52,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:21:52,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:21:52,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:21:52,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:21:52,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869135789] [2025-04-24 20:21:52,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869135789] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:21:52,702 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047479192] [2025-04-24 20:21:52,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:21:52,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:21:52,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:21:52,704 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) [2025-04-24 20:21:52,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-24 20:21:52,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-24 20:21:52,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-24 20:21:52,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:21:52,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:21:52,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-24 20:21:52,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:21:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:21:52,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:21:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:21:53,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047479192] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:21:53,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 20:21:53,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2025-04-24 20:21:53,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288437366] [2025-04-24 20:21:53,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 20:21:53,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-24 20:21:53,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:21:53,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-24 20:21:53,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-04-24 20:21:53,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:21:53,057 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:21:53,057 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 22 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) [2025-04-24 20:21:53,057 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:21:53,057 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:21:53,057 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-24 20:21:53,057 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:21:53,157 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:21:53,158 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:21:53,158 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-24 20:21:53,158 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:21:53,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-24 20:21:53,362 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:21:53,362 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:21:53,362 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:21:53,362 INFO L139 ounterexampleChecker]: Examining path program with hash -993870185, occurence #5 [2025-04-24 20:21:53,362 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:21:53,362 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 20:21:53,362 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:21:53,362 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 5 [2025-04-24 20:21:53,363 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:21:53,363 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 8 [2025-04-24 20:21:53,363 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:21:53,363 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-24 20:21:53,363 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:21:53,363 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 23 [2025-04-24 20:21:53,363 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:21:53,363 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2025-04-24 20:21:53,363 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:21:53,363 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:21:53,363 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:21:53,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:21:53,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1382797611, now seen corresponding path program 2 times [2025-04-24 20:21:53,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:21:53,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551011732] [2025-04-24 20:21:53,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 20:21:53,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:21:53,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-24 20:21:53,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 20:21:53,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 20:21:53,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:21:54,444 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-24 20:21:54,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:21:54,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551011732] [2025-04-24 20:21:54,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551011732] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:21:54,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652826343] [2025-04-24 20:21:54,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 20:21:54,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:21:54,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:21:54,447 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) [2025-04-24 20:21:54,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-24 20:21:54,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-24 20:21:54,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 20:21:54,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 20:21:54,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:21:54,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-24 20:21:54,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:21:54,643 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-24 20:21:55,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-24 20:21:55,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-24 20:21:55,254 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-24 20:21:55,254 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 23 [2025-04-24 20:21:55,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:21:55,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:21:56,178 INFO L354 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 92 treesize of output 80 [2025-04-24 20:21:56,206 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-24 20:21:56,206 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 594 treesize of output 442 [2025-04-24 20:21:59,775 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:00,202 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:00,305 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:00,644 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:00,859 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:03,371 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:07,748 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:08,013 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:14,547 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:14,707 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:34,166 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:34,367 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:45,731 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:46,218 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:22:46,578 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:47,008 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:50,247 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:51,215 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:22:51,881 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:52,541 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:53,075 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:22:53,540 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-24 20:22:54,116 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:22:54,489 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:55,415 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:56,072 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:22:57,640 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:58,928 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:22:59,547 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:22:59,853 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:23:00,677 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:23:06,224 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:23:06,987 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:23:07,366 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:23:07,795 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:23:09,057 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:23:20,518 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:23:37,215 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:23:39,394 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:24:03,725 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:24:03,736 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:25:20,578 WARN L286 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-24 20:26:15,731 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:26:18,146 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:26:19,045 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:26:20,078 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:27:15,745 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:27:16,337 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:27:22,640 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:27:28,218 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:27:28,234 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:27:30,778 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:27:34,495 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:28:34,353 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:28:35,260 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:28:35,831 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:28:36,564 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:28:36,867 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:28:57,050 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:28:57,268 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:28:58,409 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:28:59,180 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:00,025 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:00,651 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:00,911 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:02,633 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:03,250 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:05,394 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:23,383 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:23,390 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:30,241 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:30,247 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:34,317 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:36,788 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:44,529 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:47,626 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:47,885 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:52,102 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:29:52,461 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:52,771 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:29:53,022 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:53,572 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:53,914 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:29:54,191 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:29:54,397 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:55,102 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:29:55,433 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:29:55,751 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:56,255 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:29:56,512 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:56,850 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:29:57,066 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:57,299 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:29:57,742 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:29:59,533 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:12,015 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:12,742 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:13,172 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:13,477 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:14,810 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:30:15,038 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:18,947 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:20,218 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:24,156 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:30:24,413 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:30:24,670 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:30:24,904 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-24 20:30:25,127 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:30:26,931 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:30:27,215 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:30:27,441 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:27,762 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:27,989 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:31,533 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:37,560 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:37,823 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:38,482 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:38,856 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:39,214 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:30:39,520 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:40,003 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:40,337 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:30:40,571 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:30:40,841 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:41,220 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:30:42,442 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-24 20:30:43,216 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:30:43,866 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:30:48,026 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:48,483 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:30:49,067 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:50,308 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:30:50,673 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:51,190 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:52,809 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:58,886 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:30:58,892 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:31:05,879 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:31:06,434 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:31:06,862 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:31:07,202 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 20:31:07,496 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 20:31:08,890 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts.