./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6f232940 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/parallel-misc-2.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 c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6f23294-m [2025-03-19 13:38:41,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-19 13:38:41,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-03-19 13:38:41,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-19 13:38:41,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-19 13:38:41,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-19 13:38:41,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-19 13:38:41,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-19 13:38:41,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-19 13:38:41,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-19 13:38:41,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-19 13:38:41,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-19 13:38:41,768 INFO L153 SettingsManager]: * Use SBE=true [2025-03-19 13:38:41,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-19 13:38:41,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-19 13:38:41,769 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-19 13:38:41,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-19 13:38:41,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-19 13:38:41,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-19 13:38:41,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-19 13:38:41,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-19 13:38:41,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-19 13:38:41,769 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-19 13:38:41,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-19 13:38:41,770 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-19 13:38:41,770 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-19 13:38:41,770 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-19 13:38:41,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-19 13:38:41,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-19 13:38:41,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-19 13:38:41,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-19 13:38:41,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-19 13:38:41,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-19 13:38:41,771 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-19 13:38:41,771 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-03-19 13:38:41,771 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-19 13:38:41,771 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-19 13:38:41,771 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-03-19 13:38:41,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-19 13:38:41,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-03-19 13:38:41,771 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-03-19 13:38:41,771 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-03-19 13:38:41,771 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 -> c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE [2025-03-19 13:38:42,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-19 13:38:42,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-19 13:38:42,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-19 13:38:42,041 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-19 13:38:42,041 INFO L274 PluginConnector]: CDTParser initialized [2025-03-19 13:38:42,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2025-03-19 13:38:43,321 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/942bfcc0b/0e1bca0b968a441eb75b362bfd8443ee/FLAGc71851a18 [2025-03-19 13:38:43,495 INFO L389 CDTParser]: Found 1 translation units. [2025-03-19 13:38:43,495 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2025-03-19 13:38:43,502 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/942bfcc0b/0e1bca0b968a441eb75b362bfd8443ee/FLAGc71851a18 [2025-03-19 13:38:44,521 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/942bfcc0b/0e1bca0b968a441eb75b362bfd8443ee [2025-03-19 13:38:44,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-19 13:38:44,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-19 13:38:44,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-19 13:38:44,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-19 13:38:44,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-19 13:38:44,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 01:38:44" (1/1) ... [2025-03-19 13:38:44,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c958ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:44, skipping insertion in model container [2025-03-19 13:38:44,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 01:38:44" (1/1) ... [2025-03-19 13:38:44,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-19 13:38:44,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c[2249,2262] [2025-03-19 13:38:44,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-19 13:38:44,666 INFO L200 MainTranslator]: Completed pre-run [2025-03-19 13:38:44,683 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c[2249,2262] [2025-03-19 13:38:44,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-19 13:38:44,696 INFO L204 MainTranslator]: Completed translation [2025-03-19 13:38:44,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:44 WrapperNode [2025-03-19 13:38:44,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-19 13:38:44,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-19 13:38:44,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-19 13:38:44,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-19 13:38:44,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:44" (1/1) ... [2025-03-19 13:38:44,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:44" (1/1) ... [2025-03-19 13:38:44,718 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-03-19 13:38:44,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-19 13:38:44,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-19 13:38:44,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-19 13:38:44,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-19 13:38:44,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:44" (1/1) ... [2025-03-19 13:38:44,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:44" (1/1) ... [2025-03-19 13:38:44,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:44" (1/1) ... [2025-03-19 13:38:44,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:44" (1/1) ... [2025-03-19 13:38:44,730 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:44" (1/1) ... [2025-03-19 13:38:44,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:44" (1/1) ... [2025-03-19 13:38:44,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:44" (1/1) ... [2025-03-19 13:38:44,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:44" (1/1) ... [2025-03-19 13:38:44,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:44" (1/1) ... [2025-03-19 13:38:44,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-19 13:38:44,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-19 13:38:44,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-19 13:38:44,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-19 13:38:44,745 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:44" (1/1) ... [2025-03-19 13:38:44,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-19 13:38:44,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 13:38:44,768 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) [2025-03-19 13:38:44,770 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 [2025-03-19 13:38:44,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-19 13:38:44,789 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-19 13:38:44,789 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-19 13:38:44,789 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-19 13:38:44,789 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-19 13:38:44,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-19 13:38:44,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-19 13:38:44,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-19 13:38:44,790 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-19 13:38:44,856 INFO L234 CfgBuilder]: Building ICFG [2025-03-19 13:38:44,857 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-19 13:38:44,980 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-19 13:38:44,981 INFO L283 CfgBuilder]: Performing block encoding [2025-03-19 13:38:45,085 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-19 13:38:45,087 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-19 13:38:45,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 01:38:45 BoogieIcfgContainer [2025-03-19 13:38:45,087 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-19 13:38:45,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-19 13:38:45,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-19 13:38:45,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-19 13:38:45,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 01:38:44" (1/3) ... [2025-03-19 13:38:45,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b31f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 01:38:45, skipping insertion in model container [2025-03-19 13:38:45,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:44" (2/3) ... [2025-03-19 13:38:45,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b31f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 01:38:45, skipping insertion in model container [2025-03-19 13:38:45,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 01:38:45" (3/3) ... [2025-03-19 13:38:45,096 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2025-03-19 13:38:45,105 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-19 13:38:45,106 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2.wvr.c that has 3 procedures, 29 locations, 30 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-19 13:38:45,107 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-19 13:38:45,142 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-19 13:38:45,176 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 13:38:45,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-03-19 13:38:45,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 13:38:45,180 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-03-19 13:38:45,182 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-03-19 13:38:45,223 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-19 13:38:45,230 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-19 13:38:45,235 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;@65bcf462, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 13:38:45,235 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-19 13:38:45,439 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-19 13:38:45,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 13:38:45,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1464225346, now seen corresponding path program 1 times [2025-03-19 13:38:45,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 13:38:45,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280382428] [2025-03-19 13:38:45,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 13:38:45,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 13:38:45,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-19 13:38:45,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-19 13:38:45,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 13:38:45,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 13:38:45,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 13:38:45,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 13:38:45,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280382428] [2025-03-19 13:38:45,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280382428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 13:38:45,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 13:38:45,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-19 13:38:45,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615422105] [2025-03-19 13:38:45,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 13:38:45,758 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-19 13:38:45,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 13:38:45,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-19 13:38:45,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-19 13:38:45,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:38:45,771 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 13:38:45,773 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 13:38:45,773 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:38:45,851 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-19 13:38:45,852 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-19 13:38:45,852 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-19 13:38:45,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 13:38:45,852 INFO L85 PathProgramCache]: Analyzing trace with hash -910422195, now seen corresponding path program 1 times [2025-03-19 13:38:45,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 13:38:45,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539882343] [2025-03-19 13:38:45,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 13:38:45,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 13:38:45,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-19 13:38:45,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-19 13:38:45,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 13:38:45,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 13:38:46,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 13:38:46,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 13:38:46,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539882343] [2025-03-19 13:38:46,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539882343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 13:38:46,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 13:38:46,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-19 13:38:46,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780588834] [2025-03-19 13:38:46,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 13:38:46,076 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-19 13:38:46,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 13:38:46,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-19 13:38:46,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-19 13:38:46,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:38:46,079 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 13:38:46,079 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 13:38:46,079 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-19 13:38:46,079 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:38:46,140 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-19 13:38:46,140 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 13:38:46,141 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-19 13:38:46,141 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-19 13:38:46,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 13:38:46,141 INFO L85 PathProgramCache]: Analyzing trace with hash 817022079, now seen corresponding path program 1 times [2025-03-19 13:38:46,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 13:38:46,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752827191] [2025-03-19 13:38:46,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 13:38:46,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 13:38:46,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-19 13:38:46,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-19 13:38:46,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 13:38:46,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 13:38:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-19 13:38:46,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 13:38:46,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752827191] [2025-03-19 13:38:46,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752827191] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-19 13:38:46,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053878793] [2025-03-19 13:38:46,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 13:38:46,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 13:38:46,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 13:38:46,608 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-03-19 13:38:46,609 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-03-19 13:38:46,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-19 13:38:46,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-19 13:38:46,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 13:38:46,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 13:38:46,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-19 13:38:46,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 13:38:46,729 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-19 13:38:46,729 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-19 13:38:46,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053878793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 13:38:46,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-19 13:38:46,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-19 13:38:46,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101089453] [2025-03-19 13:38:46,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 13:38:46,729 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-19 13:38:46,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 13:38:46,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-19 13:38:46,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-19 13:38:46,730 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:38:46,730 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 13:38:46,730 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-03-19 13:38:46,730 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-19 13:38:46,730 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 13:38:46,730 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:38:46,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-19 13:38:46,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 13:38:46,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 13:38:46,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-19 13:38:47,009 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-19 13:38:47,009 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-19 13:38:47,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 13:38:47,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1024522145, now seen corresponding path program 1 times [2025-03-19 13:38:47,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 13:38:47,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844294361] [2025-03-19 13:38:47,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 13:38:47,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 13:38:47,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-19 13:38:47,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-19 13:38:47,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 13:38:47,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 13:38:47,356 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-19 13:38:47,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 13:38:47,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844294361] [2025-03-19 13:38:47,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844294361] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-19 13:38:47,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257076134] [2025-03-19 13:38:47,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 13:38:47,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 13:38:47,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 13:38:47,359 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-03-19 13:38:47,360 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-03-19 13:38:47,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-19 13:38:47,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-19 13:38:47,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 13:38:47,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 13:38:47,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-19 13:38:47,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 13:38:47,543 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-19 13:38:47,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-19 13:38:47,622 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-19 13:38:47,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257076134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-19 13:38:47,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-19 13:38:47,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2025-03-19 13:38:47,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539280792] [2025-03-19 13:38:47,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-19 13:38:47,624 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-19 13:38:47,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 13:38:47,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-19 13:38:47,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-19 13:38:47,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:38:47,626 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 13:38:47,626 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 13:38:47,626 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-19 13:38:47,626 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 13:38:47,626 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 13:38:47,626 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:38:48,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-19 13:38:48,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 13:38:48,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 13:38:48,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-19 13:38:48,466 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-03-19 13:38:48,663 WARN L461 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-03-19 13:38:48,663 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-19 13:38:48,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 13:38:48,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2126736295, now seen corresponding path program 2 times [2025-03-19 13:38:48,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 13:38:48,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440200352] [2025-03-19 13:38:48,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-19 13:38:48,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 13:38:48,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-03-19 13:38:48,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-03-19 13:38:48,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-19 13:38:48,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 13:38:49,142 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-19 13:38:49,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 13:38:49,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440200352] [2025-03-19 13:38:49,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440200352] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-19 13:38:49,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391728319] [2025-03-19 13:38:49,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-19 13:38:49,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 13:38:49,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 13:38:49,145 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-03-19 13:38:49,147 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-03-19 13:38:49,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-03-19 13:38:49,533 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-03-19 13:38:49,533 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-19 13:38:49,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 13:38:49,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-19 13:38:49,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 13:38:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-19 13:38:49,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-19 13:38:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-19 13:38:50,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391728319] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-19 13:38:50,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-19 13:38:50,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 29 [2025-03-19 13:38:50,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633650911] [2025-03-19 13:38:50,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-19 13:38:50,667 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-19 13:38:50,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 13:38:50,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-19 13:38:50,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2025-03-19 13:38:50,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:38:50,671 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 13:38:50,671 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.379310344827586) internal successors, (214), 29 states have internal predecessors, (214), 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-03-19 13:38:50,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-19 13:38:50,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 13:38:50,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 13:38:50,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-03-19 13:38:50,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:39:01,819 WARN L286 SmtUtils]: Spent 7.75s on a formula simplification. DAG size of input: 45 DAG size of output: 34 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-19 13:39:11,554 WARN L286 SmtUtils]: Spent 6.63s on a formula simplification. DAG size of input: 60 DAG size of output: 35 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-19 13:39:13,558 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:39:35,316 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:39:37,154 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:39:41,754 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:39:43,756 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:39:46,444 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:39:48,445 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:39:51,440 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:39:52,744 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:39:55,145 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:39:58,027 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:40:00,398 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:40:01,771 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:40:03,773 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:40:04,989 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:40:06,994 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:40:08,618 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:40:13,167 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:40:24,975 WARN L286 SmtUtils]: Spent 6.45s on a formula simplification. DAG size of input: 42 DAG size of output: 23 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-19 13:40:30,062 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:40:38,304 WARN L286 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 57 DAG size of output: 31 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-19 13:40:45,636 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:40:47,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-19 13:40:47,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 13:40:47,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 13:40:47,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-19 13:40:47,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-19 13:40:47,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-19 13:40:48,129 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 13:40:48,129 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-19 13:40:48,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 13:40:48,129 INFO L85 PathProgramCache]: Analyzing trace with hash 270988792, now seen corresponding path program 3 times [2025-03-19 13:40:48,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 13:40:48,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002870466] [2025-03-19 13:40:48,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-19 13:40:48,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 13:40:48,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 216 statements into 15 equivalence classes. [2025-03-19 13:40:48,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 216 of 216 statements. [2025-03-19 13:40:48,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-19 13:40:48,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 13:41:08,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 27 proven. 1087 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 13:41:08,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 13:41:08,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002870466] [2025-03-19 13:41:08,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002870466] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-19 13:41:08,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700471054] [2025-03-19 13:41:08,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-19 13:41:08,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 13:41:08,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 13:41:08,991 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) [2025-03-19 13:41:08,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-19 13:41:09,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 216 statements into 15 equivalence classes. [2025-03-19 13:41:11,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 216 of 216 statements. [2025-03-19 13:41:11,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-19 13:41:11,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 13:41:11,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-03-19 13:41:11,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 13:42:06,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 8 proven. 1108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 13:42:06,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-19 13:42:34,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 8 proven. 1108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 13:42:34,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700471054] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-19 13:42:34,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-19 13:42:34,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 49, 48] total 143 [2025-03-19 13:42:34,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851015268] [2025-03-19 13:42:34,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-19 13:42:34,776 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 143 states [2025-03-19 13:42:34,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 13:42:34,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2025-03-19 13:42:34,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2390, Invalid=17890, Unknown=26, NotChecked=0, Total=20306 [2025-03-19 13:42:34,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:42:34,784 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 13:42:34,784 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 143 states, 143 states have (on average 4.335664335664336) internal successors, (620), 143 states have internal predecessors, (620), 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-03-19 13:42:34,784 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-19 13:42:34,784 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 13:42:34,784 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 13:42:34,784 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-03-19 13:42:34,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2025-03-19 13:42:34,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:42:44,103 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:42:56,461 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:43:05,603 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:43:16,141 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification. DAG size of input: 57 DAG size of output: 43 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-19 13:43:29,398 WARN L286 SmtUtils]: Spent 6.41s on a formula simplification. DAG size of input: 70 DAG size of output: 50 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-19 13:43:36,662 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:43:38,836 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:43:42,287 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:43:45,245 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:44:20,825 WARN L286 SmtUtils]: Spent 11.99s on a formula simplification. DAG size of input: 65 DAG size of output: 43 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-19 13:44:28,318 WARN L286 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 62 DAG size of output: 52 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-19 13:44:31,180 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:44:47,923 WARN L286 SmtUtils]: Spent 9.74s on a formula simplification. DAG size of input: 87 DAG size of output: 58 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-19 13:44:58,977 WARN L286 SmtUtils]: Spent 6.85s on a formula simplification. DAG size of input: 83 DAG size of output: 54 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-19 13:45:07,853 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:45:10,051 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:45:11,606 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:45:38,980 WARN L286 SmtUtils]: Spent 7.87s on a formula simplification. DAG size of input: 96 DAG size of output: 51 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-19 13:45:41,077 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:45:43,114 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:45:45,117 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:45:47,179 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:45:49,190 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:45:51,291 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:46:07,816 WARN L286 SmtUtils]: Spent 7.01s on a formula simplification. DAG size of input: 59 DAG size of output: 48 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-19 13:46:10,040 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:46:26,307 WARN L286 SmtUtils]: Spent 9.56s on a formula simplification. DAG size of input: 64 DAG size of output: 36 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-19 13:46:28,777 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:47:02,810 WARN L286 SmtUtils]: Spent 17.41s on a formula simplification. DAG size of input: 72 DAG size of output: 58 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-19 13:47:12,399 WARN L286 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 69 DAG size of output: 46 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-19 13:47:14,950 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:47:17,376 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-19 13:47:19,399 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse52 (+ c_~i1~0 1))) (let ((.cse4 (mod .cse52 2)) (.cse48 (mod (+ c_~i2~0 12) 4294967296)) (.cse49 (mod (+ 5 c_~i2~0) 4294967296)) (.cse2 (mod c_~i1~0 2)) (.cse6 (* c_~N~0 2)) (.cse7 (* 4294967295 c_~i2~0))) (let ((.cse13 (mod (+ c_~i1~0 20) 4294967296)) (.cse19 (mod (+ 23 c_~i2~0) 4294967296)) (.cse30 (mod (+ c_~i2~0 17) 4294967296)) (.cse12 (mod (+ c_~i2~0 11) 4294967296)) (.cse37 (mod (+ .cse6 3 .cse7) 4294967296)) (.cse21 (+ .cse6 .cse2)) (.cse22 (mod (+ c_~i1~0 18) 4294967296)) (.cse5 (mod (+ c_~i2~0 20) 4294967296)) (.cse17 (mod c_~i1~0 4294967296)) (.cse23 (mod (+ 21 c_~i2~0) 4294967296)) (.cse35 (mod (+ c_~i1~0 14) 4294967296)) (.cse33 (mod (+ c_~i1~0 4) 4294967296)) (.cse16 (+ .cse49 .cse2 1)) (.cse29 (mod (+ c_~i1~0 15) 4294967296)) (.cse40 (mod (+ 7 c_~i2~0) 4294967296)) (.cse36 (mod (+ c_~i1~0 4294967288) 4294967296)) (.cse31 (mod (+ c_~i1~0 12) 4294967296)) (.cse26 (mod (+ 14 c_~i2~0) 4294967296)) (.cse43 (mod (+ c_~i2~0 18) 4294967296)) (.cse44 (mod (+ c_~i1~0 16) 4294967296)) (.cse15 (mod (+ c_~i1~0 2) 4294967296)) (.cse11 (mod (+ c_~i1~0 7) 4294967296)) (.cse1 (mod (+ c_~i2~0 10) 4294967296)) (.cse27 (mod (+ c_~i1~0 10) 4294967296)) (.cse24 (mod (+ c_~i1~0 4294967290) 4294967296)) (.cse25 (mod (+ c_~i1~0 11) 4294967296)) (.cse47 (mod (+ c_~i2~0 13) 4294967296)) (.cse3 (mod (+ c_~i1~0 17) 4294967296)) (.cse45 (mod (+ 19 c_~i2~0) 4294967296)) (.cse41 (mod (+ c_~i1~0 19) 4294967296)) (.cse14 (mod (+ 22 c_~i2~0) 4294967296)) (.cse18 (mod (+ 3 c_~i2~0) 4294967296)) (.cse38 (mod (+ c_~i1~0 8) 4294967296)) (.cse28 (+ .cse48 .cse2 1)) (.cse8 (* (div c_~N~0 2147483648) 4294967296)) (.cse20 (mod (+ .cse6 5 .cse7) 4294967296)) (.cse9 (mod (+ c_~i1~0 4294967286) 4294967296)) (.cse10 (+ .cse4 .cse6)) (.cse39 (mod (+ c_~i1~0 5) 4294967296)) (.cse34 (mod (+ 6 c_~i2~0) 4294967296)) (.cse50 (mod .cse52 4294967296)) (.cse46 (mod (+ c_~i2~0 4) 4294967296)) (.cse0 (mod (+ c_~i1~0 6) 4294967296)) (.cse32 (mod (+ 15 c_~i2~0) 4294967296)) (.cse51 (mod (+ c_~i1~0 13) 4294967296)) (.cse42 (mod (+ 16 c_~i2~0) 4294967296))) (and (< .cse0 (+ .cse1 .cse2 1)) (< .cse3 (+ .cse4 .cse5 1)) (<= (+ (mod (+ .cse6 4 .cse7) 4294967296) .cse8 6 .cse9) .cse10) (< .cse11 (+ .cse4 .cse12 1)) (< .cse13 (+ .cse14 .cse2 1)) (< .cse15 .cse16) (< .cse17 (+ .cse18 .cse2 1)) (< (mod (+ c_~i1~0 21) 4294967296) (+ .cse4 .cse19 1)) (<= (+ .cse8 .cse20 (mod (+ c_~i1~0 4294967285) 4294967296) 6) .cse21) (< .cse22 (+ .cse23 .cse2 1)) (<= (+ .cse8 (mod (+ .cse6 .cse7) 4294967296) 6 .cse24) .cse10) (< .cse25 (+ .cse4 .cse26 1)) (< .cse13 (+ .cse2 .cse19 1)) (< .cse27 .cse28) (< .cse29 (+ .cse4 .cse30 1)) (< .cse0 (+ (mod (+ 8 c_~i2~0) 4294967296) .cse2 1)) (< .cse31 (+ .cse32 .cse2 1)) (< .cse33 (+ .cse34 .cse2 1)) (< .cse35 (+ .cse30 .cse2 1)) (<= (+ .cse8 .cse36 6 .cse37) .cse10) (< .cse38 (+ .cse12 .cse2 1)) (< .cse39 (+ .cse4 .cse40 1)) (<= (+ .cse8 (mod (+ c_~i1~0 4294967287) 4294967296) 6 .cse37) .cse21) (< .cse22 (+ .cse5 .cse2 1)) (< .cse17 (+ .cse2 (mod (+ 2 c_~i2~0) 4294967296) 1)) (< .cse41 (+ .cse4 .cse23 1)) (< .cse35 (+ .cse42 .cse2 1)) (< .cse33 .cse16) (< .cse29 (+ .cse43 .cse4 1)) (< .cse0 (+ .cse2 .cse40 1)) (<= (+ (mod (+ .cse6 2 .cse7) 4294967296) .cse8 .cse36 6) .cse10) (< .cse31 (+ .cse26 .cse2 1)) (<= (+ .cse8 (mod (+ .cse6 6 .cse7) 4294967296) 6 (mod (+ c_~i1~0 4294967284) 4294967296)) .cse10) (< .cse44 (+ .cse43 .cse2 1)) (< .cse44 (+ .cse45 .cse2 1)) (< .cse15 (+ .cse2 .cse46 1)) (< .cse11 (+ .cse4 .cse1 1)) (< .cse27 (+ .cse47 .cse2 1)) (<= (+ (mod (+ .cse6 .cse7 1) 4294967296) .cse8 6 .cse24) .cse10) (< (mod (+ c_~i1~0 9) 4294967296) (+ .cse4 .cse48 1)) (< .cse25 (+ .cse4 .cse47 1)) (< .cse3 (+ .cse4 .cse45 1)) (< (mod (+ c_~i1~0 3) 4294967296) (+ .cse4 .cse49 1)) (< .cse41 (+ .cse4 .cse14 1)) (< .cse50 (+ .cse4 .cse18 1)) (< .cse38 .cse28) (<= (+ .cse8 .cse20 6 .cse9) .cse10) (< .cse39 (+ .cse4 .cse34 1)) (< .cse50 (+ .cse4 .cse46 1)) (< .cse0 (+ (mod (+ 9 c_~i2~0) 4294967296) .cse2 1)) (< .cse51 (+ .cse4 .cse32 1)) (< .cse51 (+ .cse4 .cse42 1)))))) is different from false [2025-03-19 13:47:21,410 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_~i1~0 1))) (let ((.cse5 (mod .cse9 2)) (.cse2 (* c_~N~0 2)) (.cse4 (mod c_~i1~0 2))) (let ((.cse1 (mod c_~i2~0 4294967296)) (.cse8 (+ .cse2 .cse4)) (.cse6 (* 4294967295 c_~i2~0)) (.cse0 (* (div c_~N~0 2147483648) 4294967296)) (.cse7 (+ .cse5 .cse2)) (.cse3 (mod (+ c_~i1~0 6) 4294967296))) (and (<= (+ .cse0 .cse1 1) .cse2) (< .cse3 (+ (mod (+ c_~i2~0 10) 4294967296) .cse4 1)) (< (mod (+ c_~i1~0 17) 4294967296) (+ .cse5 (mod (+ c_~i2~0 20) 4294967296) 1)) (<= (+ (mod (+ .cse2 4 .cse6) 4294967296) .cse0 6 (mod (+ c_~i1~0 4294967286) 4294967296)) .cse7) (< (mod (+ c_~i1~0 7) 4294967296) (+ .cse5 (mod (+ c_~i2~0 11) 4294967296) 1)) (< (mod c_~i1~0 4294967296) (+ (mod (+ 3 c_~i2~0) 4294967296) .cse4 1)) (<= (+ .cse0 (mod (+ .cse2 5 .cse6) 4294967296) (mod (+ c_~i1~0 4294967285) 4294967296) 6) .cse8) (< (mod (+ c_~i1~0 18) 4294967296) (+ (mod (+ 21 c_~i2~0) 4294967296) .cse4 1)) (<= (+ .cse0 (mod (+ .cse2 .cse6) 4294967296) 6 (mod (+ c_~i1~0 4294967290) 4294967296)) .cse7) (< (mod (+ c_~i1~0 11) 4294967296) (+ .cse5 (mod (+ 14 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 20) 4294967296) (+ .cse4 (mod (+ 23 c_~i2~0) 4294967296) 1)) (<= (+ 5 (mod (+ c_~i1~0 4294967291) 4294967296)) (+ .cse1 .cse4)) (< .cse3 (+ (mod (+ 8 c_~i2~0) 4294967296) .cse4 1)) (< (mod (+ c_~i1~0 12) 4294967296) (+ (mod (+ 15 c_~i2~0) 4294967296) .cse4 1)) (< (mod (+ c_~i1~0 4) 4294967296) (+ (mod (+ 6 c_~i2~0) 4294967296) .cse4 1)) (< (mod (+ c_~i1~0 14) 4294967296) (+ (mod (+ c_~i2~0 17) 4294967296) .cse4 1)) (<= (+ .cse0 (mod (+ c_~i1~0 4294967287) 4294967296) 6 (mod (+ .cse2 3 .cse6) 4294967296)) .cse8) (< (mod (+ c_~i1~0 15) 4294967296) (+ (mod (+ c_~i2~0 18) 4294967296) .cse5 1)) (< .cse3 (+ .cse4 (mod (+ 7 c_~i2~0) 4294967296) 1)) (<= (+ (mod (+ .cse2 2 .cse6) 4294967296) .cse0 (mod (+ c_~i1~0 4294967288) 4294967296) 6) .cse7) (<= (+ .cse0 (mod (+ .cse2 6 .cse6) 4294967296) 6 (mod (+ c_~i1~0 4294967284) 4294967296)) .cse7) (< (mod (+ c_~i1~0 16) 4294967296) (+ (mod (+ 19 c_~i2~0) 4294967296) .cse4 1)) (< (mod (+ c_~i1~0 10) 4294967296) (+ (mod (+ c_~i2~0 13) 4294967296) .cse4 1)) (< (mod (+ c_~i1~0 9) 4294967296) (+ .cse5 (mod (+ c_~i2~0 12) 4294967296) 1)) (< (mod (+ c_~i1~0 3) 4294967296) (+ .cse5 (mod (+ 5 c_~i2~0) 4294967296) 1)) (<= (+ (mod (+ .cse2 4294967295 .cse6) 4294967296) .cse0 5 (mod (+ c_~i1~0 4294967292) 4294967296)) .cse7) (< (mod (+ c_~i1~0 19) 4294967296) (+ .cse5 (mod (+ 22 c_~i2~0) 4294967296) 1)) (< (mod .cse9 4294967296) (+ .cse5 (mod (+ c_~i2~0 4) 4294967296) 1)) (< .cse3 (+ (mod (+ 9 c_~i2~0) 4294967296) .cse4 1)) (< (mod (+ c_~i1~0 13) 4294967296) (+ .cse5 (mod (+ 16 c_~i2~0) 4294967296) 1)))))) is different from false [2025-03-19 13:47:23,419 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_~i1~0 1))) (let ((.cse2 (mod .cse10 2)) (.cse5 (* c_~N~0 2)) (.cse8 (mod (+ c_~i2~0 12) 4294967296)) (.cse9 (mod (+ 5 c_~i2~0) 4294967296)) (.cse0 (mod c_~i1~0 2))) (let ((.cse1 (+ .cse9 .cse0 1)) (.cse3 (+ .cse8 .cse0 1)) (.cse4 (* (div c_~N~0 2147483648) 4294967296)) (.cse6 (* 4294967295 c_~i2~0)) (.cse7 (+ .cse2 .cse5))) (and (< (mod (+ c_~i1~0 20) 4294967296) (+ (mod (+ 22 c_~i2~0) 4294967296) .cse0 1)) (< (mod (+ c_~i1~0 2) 4294967296) .cse1) (< (mod (+ c_~i1~0 21) 4294967296) (+ .cse2 (mod (+ 23 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 10) 4294967296) .cse3) (< (mod (+ c_~i1~0 15) 4294967296) (+ .cse2 (mod (+ c_~i2~0 17) 4294967296) 1)) (<= (+ .cse4 (mod (+ c_~i1~0 4294967288) 4294967296) 6 (mod (+ .cse5 3 .cse6) 4294967296)) .cse7) (< (mod (+ c_~i1~0 18) 4294967296) (+ (mod (+ c_~i2~0 20) 4294967296) .cse0 1)) (< (mod (+ c_~i1~0 19) 4294967296) (+ .cse2 (mod (+ 21 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 14) 4294967296) (+ (mod (+ 16 c_~i2~0) 4294967296) .cse0 1)) (< (mod (+ c_~i1~0 4) 4294967296) .cse1) (< (mod (+ c_~i1~0 12) 4294967296) (+ (mod (+ 14 c_~i2~0) 4294967296) .cse0 1)) (<= (+ .cse4 (mod (+ .cse5 6 .cse6) 4294967296) 6 (mod (+ c_~i1~0 4294967284) 4294967296)) .cse7) (< (mod (+ c_~i1~0 16) 4294967296) (+ (mod (+ c_~i2~0 18) 4294967296) .cse0 1)) (< (mod (+ c_~i1~0 7) 4294967296) (+ .cse2 (mod (+ c_~i2~0 10) 4294967296) 1)) (<= (+ (mod (+ .cse5 .cse6 1) 4294967296) .cse4 6 (mod (+ c_~i1~0 4294967290) 4294967296)) .cse7) (< (mod (+ c_~i1~0 9) 4294967296) (+ .cse2 .cse8 1)) (< (mod (+ c_~i1~0 11) 4294967296) (+ .cse2 (mod (+ c_~i2~0 13) 4294967296) 1)) (< (mod (+ c_~i1~0 17) 4294967296) (+ .cse2 (mod (+ 19 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 3) 4294967296) (+ .cse2 .cse9 1)) (< (mod .cse10 4294967296) (+ .cse2 (mod (+ 3 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 8) 4294967296) .cse3) (<= (+ .cse4 (mod (+ .cse5 5 .cse6) 4294967296) 6 (mod (+ c_~i1~0 4294967286) 4294967296)) .cse7) (< (mod (+ c_~i1~0 5) 4294967296) (+ .cse2 (mod (+ 6 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 6) 4294967296) (+ (mod (+ 9 c_~i2~0) 4294967296) .cse0 1)) (< (mod (+ c_~i1~0 13) 4294967296) (+ .cse2 (mod (+ 15 c_~i2~0) 4294967296) 1)))))) is different from false [2025-03-19 13:52:01,445 WARN L286 SmtUtils]: Spent 55.45s on a formula simplification. DAG size of input: 123 DAG size of output: 123 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15