./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --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/bench-exp3x3-opt.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 df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6f23294-m [2025-03-20 02:29:49,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-20 02:29:49,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-03-20 02:29:49,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-20 02:29:49,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-20 02:29:49,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-20 02:29:49,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-20 02:29:49,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-20 02:29:49,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-20 02:29:49,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-20 02:29:49,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-20 02:29:49,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-20 02:29:49,243 INFO L153 SettingsManager]: * Use SBE=true [2025-03-20 02:29:49,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-20 02:29:49,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-20 02:29:49,243 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-20 02:29:49,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-20 02:29:49,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-20 02:29:49,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-20 02:29:49,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-20 02:29:49,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-20 02:29:49,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-20 02:29:49,243 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-20 02:29:49,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-20 02:29:49,244 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-20 02:29:49,244 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-20 02:29:49,244 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-20 02:29:49,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-20 02:29:49,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-20 02:29:49,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-20 02:29:49,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-20 02:29:49,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-20 02:29:49,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-20 02:29:49,245 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-20 02:29:49,245 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-03-20 02:29:49,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-20 02:29:49,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-20 02:29:49,245 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-03-20 02:29:49,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-20 02:29:49,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-03-20 02:29:49,245 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-03-20 02:29:49,245 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-03-20 02:29:49,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 -> df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> PERSISTENT_SETS [2025-03-20 02:29:49,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-20 02:29:49,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-20 02:29:49,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-20 02:29:49,506 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-20 02:29:49,506 INFO L274 PluginConnector]: CDTParser initialized [2025-03-20 02:29:49,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2025-03-20 02:29:50,781 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4b61dd044/defd218545524b53a7ce20dcbada000d/FLAG1a6019a05 [2025-03-20 02:29:50,910 INFO L389 CDTParser]: Found 1 translation units. [2025-03-20 02:29:50,910 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2025-03-20 02:29:50,915 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4b61dd044/defd218545524b53a7ce20dcbada000d/FLAG1a6019a05 [2025-03-20 02:29:52,881 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4b61dd044/defd218545524b53a7ce20dcbada000d [2025-03-20 02:29:52,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-20 02:29:52,884 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-20 02:29:52,885 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-20 02:29:52,885 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-20 02:29:52,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-20 02:29:52,888 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 02:29:52" (1/1) ... [2025-03-20 02:29:52,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cf1145e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:52, skipping insertion in model container [2025-03-20 02:29:52,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 02:29:52" (1/1) ... [2025-03-20 02:29:52,898 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-20 02:29:53,020 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/bench-exp3x3-opt.wvr.c[2904,2917] [2025-03-20 02:29:53,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-20 02:29:53,029 INFO L200 MainTranslator]: Completed pre-run [2025-03-20 02:29:53,049 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/bench-exp3x3-opt.wvr.c[2904,2917] [2025-03-20 02:29:53,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-20 02:29:53,064 INFO L204 MainTranslator]: Completed translation [2025-03-20 02:29:53,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:53 WrapperNode [2025-03-20 02:29:53,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-20 02:29:53,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-20 02:29:53,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-20 02:29:53,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-20 02:29:53,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:53" (1/1) ... [2025-03-20 02:29:53,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:53" (1/1) ... [2025-03-20 02:29:53,083 INFO L138 Inliner]: procedures = 24, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2025-03-20 02:29:53,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-20 02:29:53,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-20 02:29:53,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-20 02:29:53,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-20 02:29:53,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:53" (1/1) ... [2025-03-20 02:29:53,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:53" (1/1) ... [2025-03-20 02:29:53,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:53" (1/1) ... [2025-03-20 02:29:53,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:53" (1/1) ... [2025-03-20 02:29:53,094 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:53" (1/1) ... [2025-03-20 02:29:53,094 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:53" (1/1) ... [2025-03-20 02:29:53,096 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:53" (1/1) ... [2025-03-20 02:29:53,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:53" (1/1) ... [2025-03-20 02:29:53,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:53" (1/1) ... [2025-03-20 02:29:53,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-20 02:29:53,099 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-20 02:29:53,099 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-20 02:29:53,099 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-20 02:29:53,100 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:53" (1/1) ... [2025-03-20 02:29:53,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-20 02:29:53,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 02:29:53,127 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-20 02:29:53,132 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-20 02:29:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-20 02:29:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-20 02:29:53,145 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-20 02:29:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-20 02:29:53,145 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-20 02:29:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-20 02:29:53,146 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-20 02:29:53,146 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-20 02:29:53,146 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-20 02:29:53,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-20 02:29:53,146 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-03-20 02:29:53,146 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-03-20 02:29:53,146 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-03-20 02:29:53,146 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-03-20 02:29:53,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-20 02:29:53,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-20 02:29:53,147 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-20 02:29:53,207 INFO L234 CfgBuilder]: Building ICFG [2025-03-20 02:29:53,208 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-20 02:29:53,359 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-20 02:29:53,359 INFO L283 CfgBuilder]: Performing block encoding [2025-03-20 02:29:53,491 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-20 02:29:53,491 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-20 02:29:53,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 02:29:53 BoogieIcfgContainer [2025-03-20 02:29:53,491 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-20 02:29:53,493 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-20 02:29:53,493 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-20 02:29:53,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-20 02:29:53,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 02:29:52" (1/3) ... [2025-03-20 02:29:53,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27215392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 02:29:53, skipping insertion in model container [2025-03-20 02:29:53,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:53" (2/3) ... [2025-03-20 02:29:53,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27215392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 02:29:53, skipping insertion in model container [2025-03-20 02:29:53,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 02:29:53" (3/3) ... [2025-03-20 02:29:53,500 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2025-03-20 02:29:53,510 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-20 02:29:53,512 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp3x3-opt.wvr.c that has 7 procedures, 41 locations, 40 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-20 02:29:53,512 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-20 02:29:53,576 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-03-20 02:29:53,600 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 02:29:53,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-03-20 02:29:53,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 02:29:53,602 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-20 02:29:53,603 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-20 02:29:53,657 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 02:29:53,663 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 02:29:53,668 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;@20bd13ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 02:29:53,668 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-20 02:29:54,048 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 4 more)] === [2025-03-20 02:29:54,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 02:29:54,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1239757556, now seen corresponding path program 1 times [2025-03-20 02:29:54,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 02:29:54,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407686985] [2025-03-20 02:29:54,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 02:29:54,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 02:29:54,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-20 02:29:54,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-20 02:29:54,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 02:29:54,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 02:29:54,423 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-20 02:29:54,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 02:29:54,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407686985] [2025-03-20 02:29:54,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407686985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 02:29:54,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 02:29:54,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 02:29:54,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444972258] [2025-03-20 02:29:54,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 02:29:54,429 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 02:29:54,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 02:29:54,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 02:29:54,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 02:29:54,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:29:54,444 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 02:29:54,444 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 02:29:54,444 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:29:54,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:29:54,517 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-20 02:29:54,517 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 4 more)] === [2025-03-20 02:29:54,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 02:29:54,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1596739397, now seen corresponding path program 1 times [2025-03-20 02:29:54,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 02:29:54,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422636259] [2025-03-20 02:29:54,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 02:29:54,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 02:29:54,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-20 02:29:54,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-20 02:29:54,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 02:29:54,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 02:29:54,676 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-20 02:29:54,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 02:29:54,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422636259] [2025-03-20 02:29:54,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422636259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 02:29:54,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 02:29:54,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 02:29:54,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657631664] [2025-03-20 02:29:54,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 02:29:54,677 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-20 02:29:54,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 02:29:54,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-20 02:29:54,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-20 02:29:54,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:29:54,677 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 02:29:54,678 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-20 02:29:54,678 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:29:54,678 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:29:54,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:29:54,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:54,791 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-20 02:29:54,792 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 4 more)] === [2025-03-20 02:29:54,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 02:29:54,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1547078144, now seen corresponding path program 1 times [2025-03-20 02:29:54,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 02:29:54,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853242754] [2025-03-20 02:29:54,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 02:29:54,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 02:29:54,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-20 02:29:54,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-20 02:29:54,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 02:29:54,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 02:29:54,919 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-20 02:29:54,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 02:29:54,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853242754] [2025-03-20 02:29:54,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853242754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 02:29:54,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 02:29:54,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 02:29:54,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163146403] [2025-03-20 02:29:54,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 02:29:54,921 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-20 02:29:54,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 02:29:54,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-20 02:29:54,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-20 02:29:54,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:29:54,922 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 02:29:54,922 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-20 02:29:54,922 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:29:54,922 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:54,922 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:29:55,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:29:55,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:55,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:55,030 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-20 02:29:55,031 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 4 more)] === [2025-03-20 02:29:55,031 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 02:29:55,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1104178617, now seen corresponding path program 1 times [2025-03-20 02:29:55,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 02:29:55,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762958358] [2025-03-20 02:29:55,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 02:29:55,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 02:29:55,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-20 02:29:55,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-20 02:29:55,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 02:29:55,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 02:29:55,144 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-20 02:29:55,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 02:29:55,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762958358] [2025-03-20 02:29:55,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762958358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 02:29:55,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 02:29:55,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 02:29:55,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782324551] [2025-03-20 02:29:55,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 02:29:55,145 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-20 02:29:55,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 02:29:55,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-20 02:29:55,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-20 02:29:55,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:29:55,145 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 02:29:55,146 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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-20 02:29:55,146 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:29:55,146 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:55,146 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:55,146 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:29:55,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:29:55,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:55,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:55,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:55,235 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-20 02:29:55,235 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 4 more)] === [2025-03-20 02:29:55,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 02:29:55,235 INFO L85 PathProgramCache]: Analyzing trace with hash -481324696, now seen corresponding path program 1 times [2025-03-20 02:29:55,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 02:29:55,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520665767] [2025-03-20 02:29:55,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 02:29:55,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 02:29:55,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-20 02:29:55,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-20 02:29:55,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 02:29:55,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 02:29:55,667 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-20 02:29:55,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 02:29:55,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520665767] [2025-03-20 02:29:55,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520665767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 02:29:55,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 02:29:55,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-20 02:29:55,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861269703] [2025-03-20 02:29:55,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 02:29:55,668 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-20 02:29:55,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 02:29:55,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-20 02:29:55,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-20 02:29:55,668 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:29:55,668 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 02:29:55,668 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 02:29:55,668 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:29:55,668 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:55,668 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:55,668 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:55,668 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:29:56,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:29:56,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:56,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:56,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:56,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 02:29:56,516 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-20 02:29:56,517 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-20 02:29:56,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 02:29:56,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1423465489, now seen corresponding path program 2 times [2025-03-20 02:29:56,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 02:29:56,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524189938] [2025-03-20 02:29:56,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 02:29:56,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 02:29:56,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-20 02:29:56,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 40 statements. [2025-03-20 02:29:56,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 02:29:56,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 02:29:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-20 02:29:56,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 02:29:56,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524189938] [2025-03-20 02:29:56,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524189938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 02:29:56,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 02:29:56,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-20 02:29:56,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822580989] [2025-03-20 02:29:56,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 02:29:56,853 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-20 02:29:56,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 02:29:56,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-20 02:29:56,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-20 02:29:56,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:29:56,854 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 02:29:56,854 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 02:29:56,854 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:29:56,854 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:56,854 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:56,854 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:56,854 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 02:29:56,854 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:29:57,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:29:57,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:57,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:57,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:57,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 02:29:57,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:29:57,334 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-20 02:29:57,334 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-20 02:29:57,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 02:29:57,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1583163108, now seen corresponding path program 3 times [2025-03-20 02:29:57,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 02:29:57,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424931038] [2025-03-20 02:29:57,335 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 02:29:57,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 02:29:57,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 2 equivalence classes. [2025-03-20 02:29:57,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 39 of 41 statements. [2025-03-20 02:29:57,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-20 02:29:57,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 02:29:57,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-20 02:29:57,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 02:29:57,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424931038] [2025-03-20 02:29:57,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424931038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 02:29:57,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 02:29:57,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-20 02:29:57,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518961338] [2025-03-20 02:29:57,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 02:29:57,755 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-20 02:29:57,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 02:29:57,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-20 02:29:57,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-20 02:29:57,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:29:57,755 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 02:29:57,755 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 02:29:57,755 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:29:57,755 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:57,755 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:57,755 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:57,755 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 02:29:57,755 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:29:57,755 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:29:58,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:29:58,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:58,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:58,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:29:58,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 02:29:58,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:29:58,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:29:58,678 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-20 02:29:58,678 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-20 02:29:58,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 02:29:58,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1128045005, now seen corresponding path program 4 times [2025-03-20 02:29:58,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 02:29:58,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811048246] [2025-03-20 02:29:58,679 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 02:29:58,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 02:29:58,687 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-20 02:29:58,704 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-20 02:29:58,705 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-20 02:29:58,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 02:29:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-20 02:29:58,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 02:29:58,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811048246] [2025-03-20 02:29:58,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811048246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 02:29:58,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078233045] [2025-03-20 02:29:58,837 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 02:29:58,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 02:29:58,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 02:29:58,860 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-20 02:29:58,863 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-20 02:29:58,907 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-20 02:29:59,537 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-20 02:29:59,537 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-20 02:29:59,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 02:29:59,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-20 02:29:59,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 02:30:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-20 02:30:00,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 02:30:02,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-20 02:30:02,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078233045] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 02:30:02,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 02:30:02,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-20 02:30:02,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971574035] [2025-03-20 02:30:02,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 02:30:02,745 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-20 02:30:02,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 02:30:02,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-20 02:30:02,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-20 02:30:02,746 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:30:02,746 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 02:30:02,746 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.428571428571429) internal successors, (118), 13 states have internal predecessors, (118), 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-20 02:30:02,746 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:30:02,746 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:30:02,746 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:30:02,746 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:30:02,746 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 02:30:02,746 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:30:02,746 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:30:02,746 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:30:11,571 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-20 02:30:20,835 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-20 02:30:21,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:30:21,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:30:21,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:30:21,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:30:21,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 02:30:21,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:30:21,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:30:21,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-20 02:30:21,466 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-20 02:30:21,659 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,SelfDestructingSolverStorable7 [2025-03-20 02:30:21,660 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-20 02:30:21,660 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 02:30:21,660 INFO L85 PathProgramCache]: Analyzing trace with hash -298747133, now seen corresponding path program 5 times [2025-03-20 02:30:21,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 02:30:21,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467950160] [2025-03-20 02:30:21,660 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-20 02:30:21,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 02:30:21,666 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 3 equivalence classes. [2025-03-20 02:30:21,699 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-03-20 02:30:21,699 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-20 02:30:21,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 02:30:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-20 02:30:21,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 02:30:21,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467950160] [2025-03-20 02:30:21,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467950160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 02:30:21,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360570837] [2025-03-20 02:30:21,861 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-20 02:30:21,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 02:30:21,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 02:30:21,863 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-20 02:30:21,865 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-20 02:30:21,902 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 3 equivalence classes. [2025-03-20 02:30:23,246 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-03-20 02:30:23,247 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-20 02:30:23,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 02:30:23,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-20 02:30:23,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 02:30:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-20 02:30:23,390 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 02:30:23,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360570837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 02:30:23,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-20 02:30:23,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-03-20 02:30:23,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48597283] [2025-03-20 02:30:23,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 02:30:23,390 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-20 02:30:23,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 02:30:23,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-20 02:30:23,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-20 02:30:23,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:30:23,391 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 02:30:23,391 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 02:30:23,391 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:30:23,391 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:30:23,391 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:30:23,391 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:30:23,391 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 02:30:23,391 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:30:23,391 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:30:23,391 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-03-20 02:30:23,391 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:30:23,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:30:23,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:30:23,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:30:23,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:30:23,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 02:30:23,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:30:23,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:30:23,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-20 02:30:23,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 02:30:23,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-20 02:30:23,847 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 02:30:23,848 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-20 02:30:23,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 02:30:23,848 INFO L85 PathProgramCache]: Analyzing trace with hash -548824546, now seen corresponding path program 6 times [2025-03-20 02:30:23,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 02:30:23,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351688545] [2025-03-20 02:30:23,848 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-20 02:30:23,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 02:30:23,853 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 3 equivalence classes. [2025-03-20 02:30:23,877 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-03-20 02:30:23,877 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-20 02:30:23,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 02:30:23,980 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-20 02:30:23,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 02:30:23,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351688545] [2025-03-20 02:30:23,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351688545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 02:30:23,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390641125] [2025-03-20 02:30:23,981 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-20 02:30:23,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 02:30:23,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 02:30:23,983 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-20 02:30:23,984 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-20 02:30:24,023 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 3 equivalence classes. [2025-03-20 02:30:24,648 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-03-20 02:30:24,648 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-20 02:30:24,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 02:30:24,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-20 02:30:24,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 02:31:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-20 02:31:50,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 02:32:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-20 02:32:05,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390641125] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 02:32:05,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 02:32:05,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 7] total 19 [2025-03-20 02:32:05,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115868889] [2025-03-20 02:32:05,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 02:32:05,081 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-20 02:32:05,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 02:32:05,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-20 02:32:05,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=316, Unknown=11, NotChecked=0, Total=380 [2025-03-20 02:32:05,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:32:05,082 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 02:32:05,082 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.15) internal successors, (123), 19 states have internal predecessors, (123), 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-20 02:32:05,082 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:32:05,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:32:05,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:32:05,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:32:05,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 02:32:05,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:32:05,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:32:05,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-03-20 02:32:05,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 02:32:05,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:32:13,551 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-20 02:32:15,564 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-20 02:32:22,111 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-20 02:32:24,115 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-20 02:32:31,351 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-20 02:32:33,465 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-20 02:32:38,147 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-20 02:32:39,590 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-20 02:33:09,792 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-20 02:33:11,797 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-20 02:33:13,921 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-20 02:33:16,577 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-20 02:33:18,583 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-20 02:34:45,531 WARN L286 SmtUtils]: Spent 21.53s on a formula simplification. DAG size of input: 44 DAG size of output: 43 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-20 02:34:47,537 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-20 02:34:49,542 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-20 02:34:51,576 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-20 02:34:53,579 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-20 02:34:55,584 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-20 02:34:57,671 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-20 02:34:59,674 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-20 02:35:01,677 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-20 02:35:03,679 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-20 02:35:05,683 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x3~0 4294967296)) (.cse1 (mod c_~n~0 4294967296)) (.cse2 (* (- 1) c_~x3~0))) (and (= (mod c_~x6~0 4294967296) (mod c_~x5~0 4294967296)) (= .cse0 (mod c_~x4~0 4294967296)) (<= .cse1 .cse0) (<= 1 .cse1) (= (mod (* (div (* (- 1) c_~x4~0) 2) 4294967295) 4294967296) (mod (* 4294967295 (div .cse2 4)) 4294967296)) (= (mod c_~x4~0 2) 0) (= (mod c_~x3~0 2) 0) (= (mod (div .cse2 2) 2) 0))) is different from false [2025-03-20 02:35:24,898 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-20 02:35:26,903 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-20 02:35:28,905 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-20 02:35:30,907 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-20 02:35:32,908 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-20 02:35:34,910 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-20 02:35:36,913 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-20 02:35:38,915 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-20 02:35:40,917 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-20 02:35:42,919 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-20 02:35:44,921 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-20 02:35:46,923 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-20 02:35:48,925 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-20 02:35:50,927 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-20 02:35:52,929 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-20 02:35:54,931 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-20 02:35:56,933 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-20 02:35:58,934 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-20 02:36:04,322 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-20 02:36:06,325 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-20 02:36:08,327 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-20 02:36:10,329 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-20 02:36:12,332 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-20 02:36:14,334 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-20 02:36:16,335 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-20 02:36:18,338 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-20 02:36:19,632 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-20 02:36:21,635 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-20 02:36:23,638 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-20 02:36:25,275 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-20 02:36:27,279 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-20 02:37:38,220 WARN L286 SmtUtils]: Spent 32.00s on a formula simplification. DAG size of input: 49 DAG size of output: 47 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-20 02:37:40,405 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-20 02:37:42,407 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-20 02:37:45,327 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-20 02:37:47,329 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-20 02:37:49,333 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-20 02:37:51,335 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-20 02:37:53,338 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-20 02:37:55,734 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-20 02:37:57,737 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-20 02:37:59,741 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-20 02:38:01,742 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-20 02:38:03,744 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-20 02:38:05,746 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-20 02:38:07,748 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-20 02:38:09,751 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-20 02:38:11,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-20 02:38:13,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-20 02:38:15,758 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-20 02:38:17,742 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-20 02:38:19,744 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-20 02:38:21,746 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-20 02:38:23,749 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-20 02:38:25,752 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-20 02:38:27,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-20 02:38:29,759 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-20 02:38:31,761 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-20 02:38:33,763 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-20 02:38:35,767 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-20 02:38:37,771 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-20 02:38:39,575 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-20 02:38:41,578 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-20 02:38:43,580 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-20 02:38:45,582 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-20 02:38:48,371 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-20 02:38:50,372 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-20 02:38:52,357 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-20 02:38:54,359 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-20 02:38:56,363 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-20 02:38:58,366 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-20 02:39:00,368 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-20 02:39:02,369 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-20 02:39:04,371 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-20 02:39:06,373 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-20 02:39:08,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-20 02:39:10,379 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-20 02:39:12,381 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-20 02:39:14,386 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-20 02:39:16,394 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-20 02:39:18,397 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-20 02:39:20,399 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-20 02:39:22,402 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-20 02:39:24,404 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-20 02:39:26,407 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-20 02:39:28,410 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-20 02:39:30,416 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x3~0 4294967296)) (.cse2 (mod c_~n~0 4294967296)) (.cse4 (* (- 1) c_~x4~0)) (.cse3 (* (- 1) c_~x3~0))) (and (let ((.cse1 (mod c_~x4~0 4294967296))) (or (= .cse0 .cse1) (< .cse1 .cse2) (< .cse0 .cse2))) (<= .cse2 .cse0) (= (mod (* 4294967295 (div .cse3 4)) 4294967296) (mod (* 4294967295 (div .cse4 4)) 4294967296)) (<= 1 .cse2) (= (mod c_~x4~0 2) 0) (= (mod c_~x3~0 2) 0) (= (mod (div .cse4 2) 2) 0) (= (mod (div .cse3 2) 2) 0))) is different from false [2025-03-20 02:40:38,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:40:38,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:40:38,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:40:38,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:40:38,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 02:40:38,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:40:38,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:40:38,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-20 02:40:38,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 02:40:38,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-20 02:40:38,137 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-20 02:40:38,331 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 02:40:38,331 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-20 02:40:38,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 02:40:38,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1621066148, now seen corresponding path program 7 times [2025-03-20 02:40:38,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 02:40:38,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369314230] [2025-03-20 02:40:38,332 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-20 02:40:38,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 02:40:38,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-20 02:40:38,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-20 02:40:38,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 02:40:38,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 02:40:38,481 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-20 02:40:38,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 02:40:38,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369314230] [2025-03-20 02:40:38,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369314230] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 02:40:38,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427262506] [2025-03-20 02:40:38,482 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-20 02:40:38,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 02:40:38,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 02:40:38,484 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-20 02:40:38,485 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-20 02:40:38,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-20 02:40:39,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-20 02:40:39,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 02:40:39,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 02:40:39,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-20 02:40:39,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 02:40:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-20 02:40:39,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 02:40:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-20 02:40:40,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427262506] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 02:40:40,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 02:40:40,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 18 [2025-03-20 02:40:40,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396890043] [2025-03-20 02:40:40,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 02:40:40,373 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-20 02:40:40,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 02:40:40,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-20 02:40:40,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-03-20 02:40:40,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:40:40,373 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 02:40:40,373 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.052631578947368) internal successors, (115), 18 states have internal predecessors, (115), 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-20 02:40:40,373 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:40:40,373 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:40:40,373 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:40:40,373 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:40:40,373 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 02:40:40,373 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:40:40,373 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:40:40,373 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-03-20 02:40:40,373 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 02:40:40,373 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2025-03-20 02:40:40,373 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:40:44,672 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-20 02:40:44,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:40:44,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:40:44,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:40:44,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 02:40:44,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 02:40:44,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:40:44,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:40:44,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-20 02:40:44,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 02:40:44,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-20 02:40:44,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-20 02:40:44,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-20 02:40:45,183 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-20 02:40:45,184 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-20 02:40:45,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 02:40:45,184 INFO L85 PathProgramCache]: Analyzing trace with hash 940183586, now seen corresponding path program 8 times [2025-03-20 02:40:45,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 02:40:45,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746495301] [2025-03-20 02:40:45,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 02:40:45,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 02:40:45,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-20 02:40:45,552 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-20 02:40:45,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 02:40:45,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15