./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dfd4199778f3470f18ddded1b4acee60166184917bf25c1bba255dc5dd2abf98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:57:37,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:57:37,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:57:37,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:57:37,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:57:37,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:57:37,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:57:37,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:57:37,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:57:37,251 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:57:37,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:57:37,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:57:37,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:57:37,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:57:37,252 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:57:37,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:57:37,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:57:37,252 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:57:37,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:57:37,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:57:37,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:57:37,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:57:37,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:57:37,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:57:37,254 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:57:37,254 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:57:37,254 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:57:37,254 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:57:37,254 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:57:37,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:57:37,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:57:37,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:57:37,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:57:37,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:57:37,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:57:37,256 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:57:37,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:57:37,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:57:37,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:57:37,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:57:37,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:57:37,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:57:37,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:57:37,257 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/UAutomizer-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 -> Automizer 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 -> dfd4199778f3470f18ddded1b4acee60166184917bf25c1bba255dc5dd2abf98 [2025-03-03 22:57:37,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:57:37,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:57:37,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:57:37,490 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:57:37,490 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:57:37,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i [2025-03-03 22:57:38,620 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f8235fec/35cdf97169784ef9ac768086eb4b5db1/FLAG73a706aae [2025-03-03 22:57:38,886 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:57:38,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i [2025-03-03 22:57:38,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f8235fec/35cdf97169784ef9ac768086eb4b5db1/FLAG73a706aae [2025-03-03 22:57:39,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f8235fec/35cdf97169784ef9ac768086eb4b5db1 [2025-03-03 22:57:39,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:57:39,187 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:57:39,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:57:39,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:57:39,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:57:39,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:57:39" (1/1) ... [2025-03-03 22:57:39,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf0269b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:39, skipping insertion in model container [2025-03-03 22:57:39,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:57:39" (1/1) ... [2025-03-03 22:57:39,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:57:39,303 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/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i[916,929] [2025-03-03 22:57:39,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:57:39,388 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:57:39,397 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/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i[916,929] [2025-03-03 22:57:39,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:57:39,445 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:57:39,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:39 WrapperNode [2025-03-03 22:57:39,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:57:39,448 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:57:39,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:57:39,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:57:39,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:39" (1/1) ... [2025-03-03 22:57:39,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:39" (1/1) ... [2025-03-03 22:57:39,506 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2025-03-03 22:57:39,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:57:39,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:57:39,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:57:39,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:57:39,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:39" (1/1) ... [2025-03-03 22:57:39,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:39" (1/1) ... [2025-03-03 22:57:39,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:39" (1/1) ... [2025-03-03 22:57:39,541 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:57:39,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:39" (1/1) ... [2025-03-03 22:57:39,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:39" (1/1) ... [2025-03-03 22:57:39,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:39" (1/1) ... [2025-03-03 22:57:39,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:39" (1/1) ... [2025-03-03 22:57:39,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:39" (1/1) ... [2025-03-03 22:57:39,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:39" (1/1) ... [2025-03-03 22:57:39,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:57:39,564 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:57:39,564 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:57:39,564 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:57:39,565 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:39" (1/1) ... [2025-03-03 22:57:39,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:57:39,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:57:39,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:57:39,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:57:39,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:57:39,611 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:57:39,611 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:57:39,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:57:39,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:57:39,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:57:39,678 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:57:39,679 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:57:40,008 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L196: havoc property_#t~bitwise20#1; [2025-03-03 22:57:40,040 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-03 22:57:40,041 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:57:40,052 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:57:40,053 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-03 22:57:40,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:57:40 BoogieIcfgContainer [2025-03-03 22:57:40,053 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:57:40,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:57:40,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:57:40,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:57:40,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:57:39" (1/3) ... [2025-03-03 22:57:40,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b07a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:57:40, skipping insertion in model container [2025-03-03 22:57:40,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:39" (2/3) ... [2025-03-03 22:57:40,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b07a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:57:40, skipping insertion in model container [2025-03-03 22:57:40,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:57:40" (3/3) ... [2025-03-03 22:57:40,061 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-39.i [2025-03-03 22:57:40,075 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:57:40,076 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-39.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:57:40,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:57:40,123 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, 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;@7ac1e93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:57:40,124 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:57:40,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:57:40,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 22:57:40,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:57:40,138 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:57:40,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:57:40,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:57:40,143 INFO L85 PathProgramCache]: Analyzing trace with hash 999357886, now seen corresponding path program 1 times [2025-03-03 22:57:40,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:57:40,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596595033] [2025-03-03 22:57:40,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:40,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:57:40,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 22:57:40,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 22:57:40,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:40,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:40,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-03 22:57:40,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:57:40,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596595033] [2025-03-03 22:57:40,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596595033] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:57:40,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365732632] [2025-03-03 22:57:40,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:40,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:57:40,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:57:40,453 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:57:40,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:57:40,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 22:57:40,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 22:57:40,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:40,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:40,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:57:40,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:57:40,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-03 22:57:40,612 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:57:40,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365732632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:57:40,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:57:40,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:57:40,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993016405] [2025-03-03 22:57:40,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:57:40,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:57:40,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:57:40,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:57:40,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:57:40,631 INFO L87 Difference]: Start difference. First operand has 89 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 22:57:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:57:40,658 INFO L93 Difference]: Finished difference Result 172 states and 291 transitions. [2025-03-03 22:57:40,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:57:40,659 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 166 [2025-03-03 22:57:40,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:57:40,663 INFO L225 Difference]: With dead ends: 172 [2025-03-03 22:57:40,663 INFO L226 Difference]: Without dead ends: 86 [2025-03-03 22:57:40,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:57:40,668 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:57:40,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:57:40,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-03 22:57:40,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-03 22:57:40,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 60 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:57:40,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 131 transitions. [2025-03-03 22:57:40,709 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 131 transitions. Word has length 166 [2025-03-03 22:57:40,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:57:40,709 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 131 transitions. [2025-03-03 22:57:40,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 22:57:40,709 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 131 transitions. [2025-03-03 22:57:40,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 22:57:40,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:57:40,711 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:57:40,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:57:40,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:57:40,916 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:57:40,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:57:40,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1213270628, now seen corresponding path program 1 times [2025-03-03 22:57:40,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:57:40,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157133291] [2025-03-03 22:57:40,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:40,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:57:40,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 22:57:41,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 22:57:41,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:41,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:41,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-03 22:57:41,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:57:41,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157133291] [2025-03-03 22:57:41,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157133291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:57:41,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488052746] [2025-03-03 22:57:41,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:41,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:57:41,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:57:41,524 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:57:41,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:57:41,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 22:57:41,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 22:57:41,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:41,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:41,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 22:57:41,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:57:41,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-03-03 22:57:41,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:57:42,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-03 22:57:42,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488052746] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:57:42,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:57:42,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 22:57:42,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681152739] [2025-03-03 22:57:42,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:57:42,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 22:57:42,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:57:42,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 22:57:42,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:57:42,063 INFO L87 Difference]: Start difference. First operand 86 states and 131 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-03 22:57:42,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:57:42,235 INFO L93 Difference]: Finished difference Result 175 states and 264 transitions. [2025-03-03 22:57:42,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 22:57:42,237 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 166 [2025-03-03 22:57:42,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:57:42,238 INFO L225 Difference]: With dead ends: 175 [2025-03-03 22:57:42,239 INFO L226 Difference]: Without dead ends: 92 [2025-03-03 22:57:42,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:57:42,240 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 69 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:57:42,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 247 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:57:42,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-03 22:57:42,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2025-03-03 22:57:42,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:57:42,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2025-03-03 22:57:42,250 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 166 [2025-03-03 22:57:42,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:57:42,251 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2025-03-03 22:57:42,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-03 22:57:42,251 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2025-03-03 22:57:42,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 22:57:42,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:57:42,257 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:57:42,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 22:57:42,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 22:57:42,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:57:42,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:57:42,458 INFO L85 PathProgramCache]: Analyzing trace with hash 103876288, now seen corresponding path program 1 times [2025-03-03 22:57:42,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:57:42,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468679293] [2025-03-03 22:57:42,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:42,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:57:42,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 22:57:42,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 22:57:42,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:42,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:42,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:57:42,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:57:42,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468679293] [2025-03-03 22:57:42,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468679293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:57:42,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:57:42,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:57:42,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313893516] [2025-03-03 22:57:42,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:57:42,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:57:42,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:57:42,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:57:42,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:57:42,795 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:57:42,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:57:42,907 INFO L93 Difference]: Finished difference Result 248 states and 359 transitions. [2025-03-03 22:57:42,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:57:42,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2025-03-03 22:57:42,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:57:42,909 INFO L225 Difference]: With dead ends: 248 [2025-03-03 22:57:42,909 INFO L226 Difference]: Without dead ends: 161 [2025-03-03 22:57:42,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:57:42,910 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 214 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:57:42,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 254 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:57:42,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-03 22:57:42,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 105. [2025-03-03 22:57:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:57:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2025-03-03 22:57:42,927 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 167 [2025-03-03 22:57:42,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:57:42,927 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2025-03-03 22:57:42,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:57:42,927 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2025-03-03 22:57:42,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 22:57:42,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:57:42,929 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:57:42,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:57:42,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:57:42,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:57:42,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1611428097, now seen corresponding path program 1 times [2025-03-03 22:57:42,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:57:42,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918044124] [2025-03-03 22:57:42,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:42,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:57:42,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 22:57:43,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 22:57:43,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:43,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:43,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-03 22:57:43,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:57:43,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918044124] [2025-03-03 22:57:43,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918044124] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:57:43,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083796260] [2025-03-03 22:57:43,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:43,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:57:43,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:57:43,217 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:57:43,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 22:57:43,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 22:57:43,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 22:57:43,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:43,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:43,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 22:57:43,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:57:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2025-03-03 22:57:43,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:57:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-03 22:57:43,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083796260] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:57:43,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:57:43,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 22:57:43,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649134581] [2025-03-03 22:57:43,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:57:43,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:57:43,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:57:43,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:57:43,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:57:43,677 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 22:57:43,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:57:43,844 INFO L93 Difference]: Finished difference Result 215 states and 304 transitions. [2025-03-03 22:57:43,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:57:43,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 167 [2025-03-03 22:57:43,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:57:43,847 INFO L225 Difference]: With dead ends: 215 [2025-03-03 22:57:43,848 INFO L226 Difference]: Without dead ends: 102 [2025-03-03 22:57:43,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 331 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:57:43,849 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 74 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:57:43,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 242 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:57:43,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-03 22:57:43,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2025-03-03 22:57:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 69 states have internal predecessors, (88), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:57:43,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2025-03-03 22:57:43,861 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 167 [2025-03-03 22:57:43,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:57:43,862 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2025-03-03 22:57:43,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 22:57:43,862 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2025-03-03 22:57:43,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 22:57:43,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:57:43,865 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:57:43,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 22:57:44,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:57:44,066 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:57:44,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:57:44,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1973333055, now seen corresponding path program 1 times [2025-03-03 22:57:44,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:57:44,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609488853] [2025-03-03 22:57:44,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:44,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:57:44,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 22:57:44,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 22:57:44,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:44,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 3 proven. 66 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-03 22:57:45,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:57:45,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609488853] [2025-03-03 22:57:45,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609488853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:57:45,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641520401] [2025-03-03 22:57:45,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:45,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:57:45,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:57:45,253 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:57:45,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 22:57:45,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 22:57:45,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 22:57:45,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:45,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:45,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 22:57:45,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:57:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 48 proven. 132 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 22:57:51,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:57:52,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641520401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:57:52,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:57:52,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2025-03-03 22:57:52,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71498498] [2025-03-03 22:57:52,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:57:52,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 22:57:52,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:57:52,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 22:57:52,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=612, Unknown=1, NotChecked=0, Total=702 [2025-03-03 22:57:52,992 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 21 states, 21 states have (on average 4.619047619047619) internal successors, (97), 20 states have internal predecessors, (97), 5 states have call successors, (48), 3 states have call predecessors, (48), 4 states have return successors, (48), 4 states have call predecessors, (48), 5 states have call successors, (48) [2025-03-03 22:57:58,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:58:02,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:58:10,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:58:18,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:58:22,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:58:25,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:58:29,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:58:33,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:58:38,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:58:43,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:58:44,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:58:49,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:58:51,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:58:58,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:59:05,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:59:09,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:59:09,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:59:09,723 INFO L93 Difference]: Finished difference Result 609 states and 833 transitions. [2025-03-03 22:59:09,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-03 22:59:09,728 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.619047619047619) internal successors, (97), 20 states have internal predecessors, (97), 5 states have call successors, (48), 3 states have call predecessors, (48), 4 states have return successors, (48), 4 states have call predecessors, (48), 5 states have call successors, (48) Word has length 167 [2025-03-03 22:59:09,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:59:09,731 INFO L225 Difference]: With dead ends: 609 [2025-03-03 22:59:09,731 INFO L226 Difference]: Without dead ends: 514 [2025-03-03 22:59:09,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=631, Invalid=3528, Unknown=1, NotChecked=0, Total=4160 [2025-03-03 22:59:09,733 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1232 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1952 mSolverCounterSat, 216 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1233 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 2184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1952 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.6s IncrementalHoareTripleChecker+Time [2025-03-03 22:59:09,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 1412 Invalid, 2184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1952 Invalid, 16 Unknown, 0 Unchecked, 70.6s Time] [2025-03-03 22:59:09,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-03 22:59:09,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 346. [2025-03-03 22:59:09,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 254 states have (on average 1.2716535433070866) internal successors, (323), 254 states have internal predecessors, (323), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:59:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 467 transitions. [2025-03-03 22:59:09,784 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 467 transitions. Word has length 167 [2025-03-03 22:59:09,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:59:09,785 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 467 transitions. [2025-03-03 22:59:09,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.619047619047619) internal successors, (97), 20 states have internal predecessors, (97), 5 states have call successors, (48), 3 states have call predecessors, (48), 4 states have return successors, (48), 4 states have call predecessors, (48), 5 states have call successors, (48) [2025-03-03 22:59:09,785 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 467 transitions. [2025-03-03 22:59:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 22:59:09,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:59:09,787 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:59:09,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 22:59:09,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:59:09,988 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:59:09,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:59:09,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1844250336, now seen corresponding path program 1 times [2025-03-03 22:59:09,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:59:09,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525627557] [2025-03-03 22:59:09,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:59:09,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:59:10,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 22:59:10,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 22:59:10,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:59:10,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:59:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 123 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2025-03-03 22:59:10,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:59:10,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525627557] [2025-03-03 22:59:10,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525627557] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:59:10,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926705614] [2025-03-03 22:59:10,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:59:10,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:59:10,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:59:10,528 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:59:10,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 22:59:10,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 22:59:10,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 22:59:10,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:59:10,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:59:10,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 22:59:10,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:59:11,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 157 proven. 186 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2025-03-03 22:59:11,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:59:12,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 126 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2025-03-03 22:59:12,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926705614] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:59:12,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:59:12,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 11] total 28 [2025-03-03 22:59:12,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828135190] [2025-03-03 22:59:12,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:59:12,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 22:59:12,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:59:12,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 22:59:12,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2025-03-03 22:59:12,100 INFO L87 Difference]: Start difference. First operand 346 states and 467 transitions. Second operand has 28 states, 28 states have (on average 4.892857142857143) internal successors, (137), 27 states have internal predecessors, (137), 8 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (71), 8 states have call predecessors, (71), 8 states have call successors, (71) [2025-03-03 22:59:15,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:59:15,199 INFO L93 Difference]: Finished difference Result 1043 states and 1383 transitions. [2025-03-03 22:59:15,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-03 22:59:15,201 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.892857142857143) internal successors, (137), 27 states have internal predecessors, (137), 8 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (71), 8 states have call predecessors, (71), 8 states have call successors, (71) Word has length 167 [2025-03-03 22:59:15,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:59:15,204 INFO L225 Difference]: With dead ends: 1043 [2025-03-03 22:59:15,204 INFO L226 Difference]: Without dead ends: 700 [2025-03-03 22:59:15,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1068, Invalid=3902, Unknown=0, NotChecked=0, Total=4970 [2025-03-03 22:59:15,210 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 730 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:59:15,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 1002 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 22:59:15,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-03-03 22:59:15,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 324. [2025-03-03 22:59:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 229 states have (on average 1.2358078602620088) internal successors, (283), 229 states have internal predecessors, (283), 72 states have call successors, (72), 22 states have call predecessors, (72), 22 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:59:15,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 427 transitions. [2025-03-03 22:59:15,254 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 427 transitions. Word has length 167 [2025-03-03 22:59:15,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:59:15,254 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 427 transitions. [2025-03-03 22:59:15,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.892857142857143) internal successors, (137), 27 states have internal predecessors, (137), 8 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (71), 8 states have call predecessors, (71), 8 states have call successors, (71) [2025-03-03 22:59:15,254 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 427 transitions. [2025-03-03 22:59:15,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 22:59:15,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:59:15,256 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:59:15,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 22:59:15,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:59:15,461 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:59:15,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:59:15,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1011719038, now seen corresponding path program 1 times [2025-03-03 22:59:15,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:59:15,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097875596] [2025-03-03 22:59:15,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:59:15,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:59:15,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 22:59:15,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 22:59:15,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:59:15,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:59:15,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:59:15,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:59:15,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097875596] [2025-03-03 22:59:15,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097875596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:59:15,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:59:15,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:59:15,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017535248] [2025-03-03 22:59:15,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:59:15,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:59:15,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:59:15,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:59:15,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:59:15,614 INFO L87 Difference]: Start difference. First operand 324 states and 427 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:59:15,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:59:15,682 INFO L93 Difference]: Finished difference Result 647 states and 852 transitions. [2025-03-03 22:59:15,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:59:15,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2025-03-03 22:59:15,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:59:15,685 INFO L225 Difference]: With dead ends: 647 [2025-03-03 22:59:15,685 INFO L226 Difference]: Without dead ends: 326 [2025-03-03 22:59:15,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:59:15,687 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 65 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:59:15,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 451 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:59:15,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-03 22:59:15,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 219. [2025-03-03 22:59:15,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 155 states have (on average 1.2258064516129032) internal successors, (190), 155 states have internal predecessors, (190), 48 states have call successors, (48), 15 states have call predecessors, (48), 15 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 22:59:15,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 286 transitions. [2025-03-03 22:59:15,718 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 286 transitions. Word has length 167 [2025-03-03 22:59:15,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:59:15,719 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 286 transitions. [2025-03-03 22:59:15,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:59:15,719 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 286 transitions. [2025-03-03 22:59:15,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 22:59:15,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:59:15,720 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:59:15,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 22:59:15,720 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:59:15,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:59:15,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1108179356, now seen corresponding path program 1 times [2025-03-03 22:59:15,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:59:15,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280486054] [2025-03-03 22:59:15,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:59:15,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:59:15,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 22:59:15,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 22:59:15,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:59:15,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:59:16,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 132 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2025-03-03 22:59:16,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:59:16,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280486054] [2025-03-03 22:59:16,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280486054] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:59:16,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802355933] [2025-03-03 22:59:16,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:59:16,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:59:16,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:59:16,563 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:59:16,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 22:59:16,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 22:59:16,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 22:59:16,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:59:16,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:59:16,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-03 22:59:16,689 INFO L279 TraceCheckSpWp]: Computing forward predicates...