./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_fillercode_fillercodesize_ps-cn-250_file-32.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 0dc1ea3f6d575c3373292fe3183b9746ee1849ecfd8e379a22948351cc030925 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:57:27,090 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:57:27,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:57:27,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:57:27,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:57:27,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:57:27,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:57:27,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:57:27,172 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:57:27,172 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:57:27,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:57:27,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:57:27,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:57:27,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:57:27,174 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:57:27,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:57:27,174 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:57:27,174 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:57:27,174 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:57:27,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:57:27,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:57:27,175 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:57:27,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:57:27,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:57:27,175 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:57:27,175 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:57:27,175 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:57:27,175 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:57:27,175 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:57:27,175 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:57:27,175 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:57:27,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:57:27,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:57:27,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:57:27,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:57:27,176 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:57:27,176 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:57:27,176 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:57:27,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:57:27,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:57:27,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:57:27,177 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:57:27,177 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:57:27,177 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 -> 0dc1ea3f6d575c3373292fe3183b9746ee1849ecfd8e379a22948351cc030925 [2025-03-08 10:57:27,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:57:27,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:57:27,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:57:27,437 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:57:27,437 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:57:27,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-32.i [2025-03-08 10:57:28,660 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84306cff5/a97621750d07447db46c6156bc77a73e/FLAGe94dd3ebd [2025-03-08 10:57:28,961 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:57:28,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-32.i [2025-03-08 10:57:28,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84306cff5/a97621750d07447db46c6156bc77a73e/FLAGe94dd3ebd [2025-03-08 10:57:28,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84306cff5/a97621750d07447db46c6156bc77a73e [2025-03-08 10:57:28,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:57:28,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:57:28,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:57:28,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:57:29,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:57:29,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:57:28" (1/1) ... [2025-03-08 10:57:29,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4414e23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:29, skipping insertion in model container [2025-03-08 10:57:29,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:57:28" (1/1) ... [2025-03-08 10:57:29,034 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:57:29,142 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_fillercode_fillercodesize_ps-cn-250_file-32.i[916,929] [2025-03-08 10:57:29,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:57:29,276 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:57:29,285 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_fillercode_fillercodesize_ps-cn-250_file-32.i[916,929] [2025-03-08 10:57:29,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:57:29,373 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:57:29,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:29 WrapperNode [2025-03-08 10:57:29,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:57:29,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:57:29,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:57:29,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:57:29,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:29" (1/1) ... [2025-03-08 10:57:29,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:29" (1/1) ... [2025-03-08 10:57:29,426 INFO L138 Inliner]: procedures = 26, calls = 87, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 586 [2025-03-08 10:57:29,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:57:29,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:57:29,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:57:29,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:57:29,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:29" (1/1) ... [2025-03-08 10:57:29,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:29" (1/1) ... [2025-03-08 10:57:29,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:29" (1/1) ... [2025-03-08 10:57:29,468 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-08 10:57:29,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:29" (1/1) ... [2025-03-08 10:57:29,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:29" (1/1) ... [2025-03-08 10:57:29,489 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:29" (1/1) ... [2025-03-08 10:57:29,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:29" (1/1) ... [2025-03-08 10:57:29,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:29" (1/1) ... [2025-03-08 10:57:29,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:29" (1/1) ... [2025-03-08 10:57:29,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:57:29,522 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:57:29,522 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:57:29,522 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:57:29,523 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:29" (1/1) ... [2025-03-08 10:57:29,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:57:29,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:57:29,551 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-08 10:57:29,558 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-08 10:57:29,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:57:29,574 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:57:29,574 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:57:29,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:57:29,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:57:29,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:57:29,676 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:57:29,677 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:57:30,403 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 10:57:30,404 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:57:30,436 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:57:30,440 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-08 10:57:30,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:57:30 BoogieIcfgContainer [2025-03-08 10:57:30,440 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:57:30,442 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:57:30,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:57:30,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:57:30,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:57:28" (1/3) ... [2025-03-08 10:57:30,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df8a3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:57:30, skipping insertion in model container [2025-03-08 10:57:30,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:29" (2/3) ... [2025-03-08 10:57:30,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df8a3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:57:30, skipping insertion in model container [2025-03-08 10:57:30,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:57:30" (3/3) ... [2025-03-08 10:57:30,450 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-32.i [2025-03-08 10:57:30,462 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:57:30,466 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-32.i that has 2 procedures, 242 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:57:30,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:57:30,536 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;@2b8b8731, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:57:30,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:57:30,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 242 states, 165 states have (on average 1.5454545454545454) internal successors, (255), 166 states have internal predecessors, (255), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 10:57:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-08 10:57:30,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:30,574 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:30,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:30,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:30,580 INFO L85 PathProgramCache]: Analyzing trace with hash 446498748, now seen corresponding path program 1 times [2025-03-08 10:57:30,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:30,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884251246] [2025-03-08 10:57:30,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:30,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:30,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 10:57:30,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 10:57:30,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:30,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:31,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-03-08 10:57:31,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:31,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884251246] [2025-03-08 10:57:31,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884251246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:57:31,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619503901] [2025-03-08 10:57:31,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:31,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:57:31,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:57:31,064 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-08 10:57:31,066 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-08 10:57:31,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 10:57:31,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 10:57:31,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:31,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:31,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:57:31,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:57:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-03-08 10:57:31,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:57:31,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619503901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:31,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:57:31,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:57:31,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11022797] [2025-03-08 10:57:31,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:31,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:57:31,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:31,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:57:31,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:57:31,443 INFO L87 Difference]: Start difference. First operand has 242 states, 165 states have (on average 1.5454545454545454) internal successors, (255), 166 states have internal predecessors, (255), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) Second operand has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-08 10:57:31,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:31,508 INFO L93 Difference]: Finished difference Result 478 states and 875 transitions. [2025-03-08 10:57:31,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:57:31,513 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) Word has length 466 [2025-03-08 10:57:31,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:31,523 INFO L225 Difference]: With dead ends: 478 [2025-03-08 10:57:31,524 INFO L226 Difference]: Without dead ends: 239 [2025-03-08 10:57:31,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 467 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-08 10:57:31,532 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:31,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 384 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:57:31,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-08 10:57:31,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2025-03-08 10:57:31,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 163 states have (on average 1.5337423312883436) internal successors, (250), 163 states have internal predecessors, (250), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 10:57:31,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 398 transitions. [2025-03-08 10:57:31,601 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 398 transitions. Word has length 466 [2025-03-08 10:57:31,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:31,603 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 398 transitions. [2025-03-08 10:57:31,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-08 10:57:31,604 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 398 transitions. [2025-03-08 10:57:31,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-08 10:57:31,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:31,613 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:31,621 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-08 10:57:31,813 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-08 10:57:31,814 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:31,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:31,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1652135784, now seen corresponding path program 1 times [2025-03-08 10:57:31,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:31,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659514423] [2025-03-08 10:57:31,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:31,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:31,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 10:57:31,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 10:57:31,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:31,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 10:57:32,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:32,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659514423] [2025-03-08 10:57:32,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659514423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:32,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:32,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:57:32,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226730620] [2025-03-08 10:57:32,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:32,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:57:32,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:32,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:57:32,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:57:32,264 INFO L87 Difference]: Start difference. First operand 239 states and 398 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:57:32,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:32,375 INFO L93 Difference]: Finished difference Result 710 states and 1186 transitions. [2025-03-08 10:57:32,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:57:32,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 466 [2025-03-08 10:57:32,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:32,385 INFO L225 Difference]: With dead ends: 710 [2025-03-08 10:57:32,386 INFO L226 Difference]: Without dead ends: 474 [2025-03-08 10:57:32,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:57:32,389 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 387 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:32,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 828 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:57:32,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-03-08 10:57:32,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 468. [2025-03-08 10:57:32,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 317 states have (on average 1.5331230283911672) internal successors, (486), 317 states have internal predecessors, (486), 148 states have call successors, (148), 2 states have call predecessors, (148), 2 states have return successors, (148), 148 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-08 10:57:32,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 782 transitions. [2025-03-08 10:57:32,466 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 782 transitions. Word has length 466 [2025-03-08 10:57:32,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:32,469 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 782 transitions. [2025-03-08 10:57:32,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:57:32,470 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 782 transitions. [2025-03-08 10:57:32,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-08 10:57:32,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:32,477 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:32,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:57:32,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:32,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:32,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2132297335, now seen corresponding path program 1 times [2025-03-08 10:57:32,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:32,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525264657] [2025-03-08 10:57:32,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:32,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:32,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 10:57:32,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 10:57:32,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:32,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 10:57:32,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:32,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525264657] [2025-03-08 10:57:32,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525264657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:32,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:32,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:57:32,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552011886] [2025-03-08 10:57:32,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:32,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:57:32,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:32,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:57:32,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:57:32,873 INFO L87 Difference]: Start difference. First operand 468 states and 782 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:57:32,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:32,991 INFO L93 Difference]: Finished difference Result 1260 states and 2108 transitions. [2025-03-08 10:57:32,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:57:32,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 466 [2025-03-08 10:57:32,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:33,000 INFO L225 Difference]: With dead ends: 1260 [2025-03-08 10:57:33,001 INFO L226 Difference]: Without dead ends: 795 [2025-03-08 10:57:33,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:57:33,006 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 252 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:33,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 747 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:57:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-03-08 10:57:33,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 791. [2025-03-08 10:57:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 538 states have (on average 1.5278810408921932) internal successors, (822), 540 states have internal predecessors, (822), 248 states have call successors, (248), 4 states have call predecessors, (248), 4 states have return successors, (248), 246 states have call predecessors, (248), 248 states have call successors, (248) [2025-03-08 10:57:33,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1318 transitions. [2025-03-08 10:57:33,144 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1318 transitions. Word has length 466 [2025-03-08 10:57:33,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:33,146 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1318 transitions. [2025-03-08 10:57:33,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:57:33,147 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1318 transitions. [2025-03-08 10:57:33,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-08 10:57:33,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:33,153 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:33,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:57:33,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:33,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:33,154 INFO L85 PathProgramCache]: Analyzing trace with hash -655118152, now seen corresponding path program 1 times [2025-03-08 10:57:33,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:33,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541140287] [2025-03-08 10:57:33,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:33,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:33,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 10:57:33,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 10:57:33,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:33,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:33,435 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 10:57:33,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:33,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541140287] [2025-03-08 10:57:33,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541140287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:33,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:33,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:57:33,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446700668] [2025-03-08 10:57:33,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:33,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:57:33,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:33,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:57:33,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:57:33,438 INFO L87 Difference]: Start difference. First operand 791 states and 1318 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:57:33,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:33,694 INFO L93 Difference]: Finished difference Result 2085 states and 3486 transitions. [2025-03-08 10:57:33,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:57:33,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 466 [2025-03-08 10:57:33,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:33,705 INFO L225 Difference]: With dead ends: 2085 [2025-03-08 10:57:33,706 INFO L226 Difference]: Without dead ends: 1297 [2025-03-08 10:57:33,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:57:33,711 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 238 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:33,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 1473 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:57:33,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2025-03-08 10:57:33,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1291. [2025-03-08 10:57:33,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 958 states have (on average 1.582463465553236) internal successors, (1516), 964 states have internal predecessors, (1516), 324 states have call successors, (324), 8 states have call predecessors, (324), 8 states have return successors, (324), 318 states have call predecessors, (324), 324 states have call successors, (324) [2025-03-08 10:57:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 2164 transitions. [2025-03-08 10:57:33,868 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 2164 transitions. Word has length 466 [2025-03-08 10:57:33,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:33,869 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 2164 transitions. [2025-03-08 10:57:33,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:57:33,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2164 transitions. [2025-03-08 10:57:33,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-08 10:57:33,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:33,877 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:33,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:57:33,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:33,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:33,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1241990182, now seen corresponding path program 1 times [2025-03-08 10:57:33,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:33,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823777842] [2025-03-08 10:57:33,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:33,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:33,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 10:57:33,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 10:57:33,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:33,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:34,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 10:57:34,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:34,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823777842] [2025-03-08 10:57:34,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823777842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:34,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:34,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:57:34,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982366834] [2025-03-08 10:57:34,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:34,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:57:34,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:34,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:57:34,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:57:34,267 INFO L87 Difference]: Start difference. First operand 1291 states and 2164 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:57:34,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:34,787 INFO L93 Difference]: Finished difference Result 4601 states and 7737 transitions. [2025-03-08 10:57:34,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:57:34,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 466 [2025-03-08 10:57:34,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:34,808 INFO L225 Difference]: With dead ends: 4601 [2025-03-08 10:57:34,809 INFO L226 Difference]: Without dead ends: 3313 [2025-03-08 10:57:34,815 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-08 10:57:34,816 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 812 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:34,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1024 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 10:57:34,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3313 states. [2025-03-08 10:57:35,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3313 to 3301. [2025-03-08 10:57:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3301 states, 2616 states have (on average 1.6200305810397553) internal successors, (4238), 2638 states have internal predecessors, (4238), 660 states have call successors, (660), 24 states have call predecessors, (660), 24 states have return successors, (660), 638 states have call predecessors, (660), 660 states have call successors, (660) [2025-03-08 10:57:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3301 states to 3301 states and 5558 transitions. [2025-03-08 10:57:35,037 INFO L78 Accepts]: Start accepts. Automaton has 3301 states and 5558 transitions. Word has length 466 [2025-03-08 10:57:35,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:35,040 INFO L471 AbstractCegarLoop]: Abstraction has 3301 states and 5558 transitions. [2025-03-08 10:57:35,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:57:35,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3301 states and 5558 transitions. [2025-03-08 10:57:35,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-08 10:57:35,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:35,052 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:35,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:57:35,052 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:35,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:35,053 INFO L85 PathProgramCache]: Analyzing trace with hash 987253637, now seen corresponding path program 1 times [2025-03-08 10:57:35,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:35,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409910557] [2025-03-08 10:57:35,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:35,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:35,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 10:57:35,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 10:57:35,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:35,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 10:57:36,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:36,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409910557] [2025-03-08 10:57:36,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409910557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:36,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:36,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:57:36,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432327908] [2025-03-08 10:57:36,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:36,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:57:36,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:36,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:57:36,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:57:36,572 INFO L87 Difference]: Start difference. First operand 3301 states and 5558 transitions. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:57:39,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:39,889 INFO L93 Difference]: Finished difference Result 13173 states and 22077 transitions. [2025-03-08 10:57:39,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 10:57:39,890 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 466 [2025-03-08 10:57:39,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:39,950 INFO L225 Difference]: With dead ends: 13173 [2025-03-08 10:57:39,950 INFO L226 Difference]: Without dead ends: 9875 [2025-03-08 10:57:39,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2025-03-08 10:57:39,964 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 2374 mSDsluCounter, 2086 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2374 SdHoareTripleChecker+Valid, 2511 SdHoareTripleChecker+Invalid, 2117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 424 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:39,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2374 Valid, 2511 Invalid, 2117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [424 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 10:57:39,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9875 states. [2025-03-08 10:57:40,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9875 to 7069. [2025-03-08 10:57:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7069 states, 5673 states have (on average 1.6296492155825841) internal successors, (9245), 5718 states have internal predecessors, (9245), 1345 states have call successors, (1345), 50 states have call predecessors, (1345), 50 states have return successors, (1345), 1300 states have call predecessors, (1345), 1345 states have call successors, (1345) [2025-03-08 10:57:40,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7069 states to 7069 states and 11935 transitions. [2025-03-08 10:57:40,474 INFO L78 Accepts]: Start accepts. Automaton has 7069 states and 11935 transitions. Word has length 466 [2025-03-08 10:57:40,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:40,475 INFO L471 AbstractCegarLoop]: Abstraction has 7069 states and 11935 transitions. [2025-03-08 10:57:40,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:57:40,475 INFO L276 IsEmpty]: Start isEmpty. Operand 7069 states and 11935 transitions. [2025-03-08 10:57:40,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-08 10:57:40,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:40,484 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:40,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:57:40,485 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:40,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:40,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1198604550, now seen corresponding path program 1 times [2025-03-08 10:57:40,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:40,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856804770] [2025-03-08 10:57:40,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:40,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:40,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 10:57:40,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 10:57:40,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:40,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:41,002 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 42 proven. 177 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-03-08 10:57:41,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:41,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856804770] [2025-03-08 10:57:41,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856804770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:57:41,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611476224] [2025-03-08 10:57:41,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:41,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:57:41,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:57:41,005 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-08 10:57:41,007 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-08 10:57:41,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 10:57:41,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 10:57:41,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:41,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:41,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 10:57:41,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:57:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 4545 proven. 63 refuted. 0 times theorem prover too weak. 6196 trivial. 0 not checked. [2025-03-08 10:57:42,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:57:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 156 proven. 63 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-03-08 10:57:42,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611476224] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:57:42,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:57:42,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 7] total 15 [2025-03-08 10:57:42,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790744572] [2025-03-08 10:57:42,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:57:42,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 10:57:42,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:42,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 10:57:42,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-08 10:57:42,548 INFO L87 Difference]: Start difference. First operand 7069 states and 11935 transitions. Second operand has 15 states, 15 states have (on average 18.133333333333333) internal successors, (272), 15 states have internal predecessors, (272), 6 states have call successors, (222), 3 states have call predecessors, (222), 6 states have return successors, (222), 6 states have call predecessors, (222), 6 states have call successors, (222) [2025-03-08 10:57:47,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:47,879 INFO L93 Difference]: Finished difference Result 36211 states and 59787 transitions. [2025-03-08 10:57:47,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-08 10:57:47,880 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 18.133333333333333) internal successors, (272), 15 states have internal predecessors, (272), 6 states have call successors, (222), 3 states have call predecessors, (222), 6 states have return successors, (222), 6 states have call predecessors, (222), 6 states have call successors, (222) Word has length 466 [2025-03-08 10:57:47,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:48,021 INFO L225 Difference]: With dead ends: 36211 [2025-03-08 10:57:48,021 INFO L226 Difference]: Without dead ends: 29193 [2025-03-08 10:57:48,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1011 GetRequests, 935 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2237 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1292, Invalid=4714, Unknown=0, NotChecked=0, Total=6006 [2025-03-08 10:57:48,053 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 2781 mSDsluCounter, 3051 mSDsCounter, 0 mSdLazyCounter, 3415 mSolverCounterSat, 1939 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2799 SdHoareTripleChecker+Valid, 3784 SdHoareTripleChecker+Invalid, 5354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1939 IncrementalHoareTripleChecker+Valid, 3415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:48,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2799 Valid, 3784 Invalid, 5354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1939 Valid, 3415 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-08 10:57:48,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29193 states. [2025-03-08 10:57:49,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29193 to 19613. [2025-03-08 10:57:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19613 states, 14756 states have (on average 1.5420168067226891) internal successors, (22754), 14919 states have internal predecessors, (22754), 4513 states have call successors, (4513), 343 states have call predecessors, (4513), 343 states have return successors, (4513), 4350 states have call predecessors, (4513), 4513 states have call successors, (4513) [2025-03-08 10:57:49,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19613 states to 19613 states and 31780 transitions. [2025-03-08 10:57:49,615 INFO L78 Accepts]: Start accepts. Automaton has 19613 states and 31780 transitions. Word has length 466 [2025-03-08 10:57:49,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:49,616 INFO L471 AbstractCegarLoop]: Abstraction has 19613 states and 31780 transitions. [2025-03-08 10:57:49,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 18.133333333333333) internal successors, (272), 15 states have internal predecessors, (272), 6 states have call successors, (222), 3 states have call predecessors, (222), 6 states have return successors, (222), 6 states have call predecessors, (222), 6 states have call successors, (222) [2025-03-08 10:57:49,617 INFO L276 IsEmpty]: Start isEmpty. Operand 19613 states and 31780 transitions. [2025-03-08 10:57:49,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-08 10:57:49,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:49,629 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:49,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 10:57:49,830 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,SelfDestructingSolverStorable6 [2025-03-08 10:57:49,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:49,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:49,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1750356693, now seen corresponding path program 1 times [2025-03-08 10:57:49,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:49,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295453175] [2025-03-08 10:57:49,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:49,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:49,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-08 10:57:49,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-08 10:57:49,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:49,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 10:57:51,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:51,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295453175] [2025-03-08 10:57:51,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295453175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:51,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:51,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 10:57:51,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434458668] [2025-03-08 10:57:51,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:51,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 10:57:51,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:51,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 10:57:51,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:57:51,058 INFO L87 Difference]: Start difference. First operand 19613 states and 31780 transitions. Second operand has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:57:56,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:56,114 INFO L93 Difference]: Finished difference Result 46652 states and 75200 transitions. [2025-03-08 10:57:56,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 10:57:56,115 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 468 [2025-03-08 10:57:56,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:56,254 INFO L225 Difference]: With dead ends: 46652 [2025-03-08 10:57:56,254 INFO L226 Difference]: Without dead ends: 33174 [2025-03-08 10:57:56,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2025-03-08 10:57:56,304 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 3449 mSDsluCounter, 2335 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 1177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3449 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1177 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:56,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3449 Valid, 2761 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1177 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 10:57:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33174 states. [2025-03-08 10:57:57,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33174 to 20061. [2025-03-08 10:57:57,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20061 states, 15204 states have (on average 1.5486714022625625) internal successors, (23546), 15367 states have internal predecessors, (23546), 4513 states have call successors, (4513), 343 states have call predecessors, (4513), 343 states have return successors, (4513), 4350 states have call predecessors, (4513), 4513 states have call successors, (4513) [2025-03-08 10:57:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20061 states to 20061 states and 32572 transitions. [2025-03-08 10:57:57,913 INFO L78 Accepts]: Start accepts. Automaton has 20061 states and 32572 transitions. Word has length 468 [2025-03-08 10:57:57,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:57,915 INFO L471 AbstractCegarLoop]: Abstraction has 20061 states and 32572 transitions. [2025-03-08 10:57:57,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:57:57,915 INFO L276 IsEmpty]: Start isEmpty. Operand 20061 states and 32572 transitions. [2025-03-08 10:57:57,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-08 10:57:57,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:57,929 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:57,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:57:57,929 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:57,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:57,930 INFO L85 PathProgramCache]: Analyzing trace with hash 506554314, now seen corresponding path program 1 times [2025-03-08 10:57:57,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:57,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059232409] [2025-03-08 10:57:57,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:57,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:57,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-08 10:57:58,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-08 10:57:58,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:58,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 153 proven. 66 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-03-08 10:57:58,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:58,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059232409] [2025-03-08 10:57:58,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059232409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:57:58,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124463090] [2025-03-08 10:57:58,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:58,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:57:58,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:57:58,302 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-08 10:57:58,304 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-08 10:57:58,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-08 10:57:58,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-08 10:57:58,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:58,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:58,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 10:57:58,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:57:58,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 4663 proven. 66 refuted. 0 times theorem prover too weak. 6075 trivial. 0 not checked. [2025-03-08 10:57:58,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:57:59,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 153 proven. 66 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-03-08 10:57:59,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124463090] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:57:59,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:57:59,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 10:57:59,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508664589] [2025-03-08 10:57:59,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:57:59,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:57:59,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:59,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:57:59,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:57:59,061 INFO L87 Difference]: Start difference. First operand 20061 states and 32572 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 2 states have call successors, (96), 2 states have call predecessors, (96), 4 states have return successors, (97), 2 states have call predecessors, (97), 2 states have call successors, (97) [2025-03-08 10:58:00,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:00,012 INFO L93 Difference]: Finished difference Result 34517 states and 56339 transitions. [2025-03-08 10:58:00,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:58:00,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 2 states have call successors, (96), 2 states have call predecessors, (96), 4 states have return successors, (97), 2 states have call predecessors, (97), 2 states have call successors, (97) Word has length 468 [2025-03-08 10:58:00,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:00,081 INFO L225 Difference]: With dead ends: 34517 [2025-03-08 10:58:00,081 INFO L226 Difference]: Without dead ends: 14511 [2025-03-08 10:58:00,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 943 GetRequests, 933 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:58:00,134 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 434 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:00,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 742 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:58:00,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14511 states. [2025-03-08 10:58:01,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14511 to 8571. [2025-03-08 10:58:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8571 states, 6668 states have (on average 1.5554889022195562) internal successors, (10372), 6723 states have internal predecessors, (10372), 1751 states have call successors, (1751), 151 states have call predecessors, (1751), 151 states have return successors, (1751), 1696 states have call predecessors, (1751), 1751 states have call successors, (1751) [2025-03-08 10:58:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8571 states to 8571 states and 13874 transitions. [2025-03-08 10:58:01,137 INFO L78 Accepts]: Start accepts. Automaton has 8571 states and 13874 transitions. Word has length 468 [2025-03-08 10:58:01,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:01,138 INFO L471 AbstractCegarLoop]: Abstraction has 8571 states and 13874 transitions. [2025-03-08 10:58:01,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 2 states have call successors, (96), 2 states have call predecessors, (96), 4 states have return successors, (97), 2 states have call predecessors, (97), 2 states have call successors, (97) [2025-03-08 10:58:01,138 INFO L276 IsEmpty]: Start isEmpty. Operand 8571 states and 13874 transitions. [2025-03-08 10:58:01,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-08 10:58:01,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:01,148 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:58:01,156 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-08 10:58:01,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:58:01,349 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:01,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:01,350 INFO L85 PathProgramCache]: Analyzing trace with hash -3979863, now seen corresponding path program 1 times [2025-03-08 10:58:01,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:01,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685529607] [2025-03-08 10:58:01,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:01,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:01,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-08 10:58:01,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-08 10:58:01,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:01,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 10:58:01,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:01,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685529607] [2025-03-08 10:58:01,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685529607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:58:01,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:58:01,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:58:01,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556002695] [2025-03-08 10:58:01,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:58:01,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:58:01,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:01,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:58:01,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:58:01,673 INFO L87 Difference]: Start difference. First operand 8571 states and 13874 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:58:02,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:02,089 INFO L93 Difference]: Finished difference Result 14383 states and 23487 transitions. [2025-03-08 10:58:02,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:58:02,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 468 [2025-03-08 10:58:02,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:02,114 INFO L225 Difference]: With dead ends: 14383 [2025-03-08 10:58:02,114 INFO L226 Difference]: Without dead ends: 3321 [2025-03-08 10:58:02,266 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-08 10:58:02,266 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 518 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:02,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 790 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:58:02,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3321 states. [2025-03-08 10:58:02,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3321 to 3313. [2025-03-08 10:58:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3313 states, 2538 states have (on average 1.5240346729708432) internal successors, (3868), 2561 states have internal predecessors, (3868), 711 states have call successors, (711), 63 states have call predecessors, (711), 63 states have return successors, (711), 688 states have call predecessors, (711), 711 states have call successors, (711) [2025-03-08 10:58:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3313 states to 3313 states and 5290 transitions. [2025-03-08 10:58:02,501 INFO L78 Accepts]: Start accepts. Automaton has 3313 states and 5290 transitions. Word has length 468 [2025-03-08 10:58:02,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:02,502 INFO L471 AbstractCegarLoop]: Abstraction has 3313 states and 5290 transitions. [2025-03-08 10:58:02,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:58:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3313 states and 5290 transitions. [2025-03-08 10:58:02,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-08 10:58:02,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:02,506 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:58:02,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 10:58:02,506 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:02,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:02,507 INFO L85 PathProgramCache]: Analyzing trace with hash -175849292, now seen corresponding path program 1 times [2025-03-08 10:58:02,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:02,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231865249] [2025-03-08 10:58:02,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:02,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:02,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-08 10:58:02,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-08 10:58:02,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:02,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 162 proven. 57 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-03-08 10:58:02,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:02,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231865249] [2025-03-08 10:58:02,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231865249] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:58:02,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153805487] [2025-03-08 10:58:02,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:02,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:58:02,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:58:02,872 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-08 10:58:02,874 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-08 10:58:02,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-08 10:58:03,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-08 10:58:03,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:03,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:03,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 10:58:03,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:58:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 4306 proven. 108 refuted. 0 times theorem prover too weak. 6390 trivial. 0 not checked. [2025-03-08 10:58:03,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:58:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 162 proven. 57 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-03-08 10:58:03,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153805487] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:58:03,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:58:03,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 12 [2025-03-08 10:58:03,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621159986] [2025-03-08 10:58:03,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:58:03,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 10:58:03,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:03,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 10:58:03,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-08 10:58:03,770 INFO L87 Difference]: Start difference. First operand 3313 states and 5290 transitions. Second operand has 12 states, 12 states have (on average 13.166666666666666) internal successors, (158), 12 states have internal predecessors, (158), 3 states have call successors, (93), 3 states have call predecessors, (93), 5 states have return successors, (94), 3 states have call predecessors, (94), 3 states have call successors, (94) [2025-03-08 10:58:05,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:05,106 INFO L93 Difference]: Finished difference Result 8829 states and 14067 transitions. [2025-03-08 10:58:05,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 10:58:05,107 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.166666666666666) internal successors, (158), 12 states have internal predecessors, (158), 3 states have call successors, (93), 3 states have call predecessors, (93), 5 states have return successors, (94), 3 states have call predecessors, (94), 3 states have call successors, (94) Word has length 469 [2025-03-08 10:58:05,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:05,127 INFO L225 Difference]: With dead ends: 8829 [2025-03-08 10:58:05,127 INFO L226 Difference]: Without dead ends: 5571 [2025-03-08 10:58:05,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 967 GetRequests, 933 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=296, Invalid=760, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 10:58:05,136 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 1376 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 588 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1432 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 588 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:05,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1432 Valid, 1596 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [588 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 10:58:05,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5571 states. [2025-03-08 10:58:05,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5571 to 3783. [2025-03-08 10:58:05,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3783 states, 3000 states have (on average 1.5173333333333334) internal successors, (4552), 3023 states have internal predecessors, (4552), 711 states have call successors, (711), 71 states have call predecessors, (711), 71 states have return successors, (711), 688 states have call predecessors, (711), 711 states have call successors, (711) [2025-03-08 10:58:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3783 states to 3783 states and 5974 transitions. [2025-03-08 10:58:05,455 INFO L78 Accepts]: Start accepts. Automaton has 3783 states and 5974 transitions. Word has length 469 [2025-03-08 10:58:05,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:05,457 INFO L471 AbstractCegarLoop]: Abstraction has 3783 states and 5974 transitions. [2025-03-08 10:58:05,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.166666666666666) internal successors, (158), 12 states have internal predecessors, (158), 3 states have call successors, (93), 3 states have call predecessors, (93), 5 states have return successors, (94), 3 states have call predecessors, (94), 3 states have call successors, (94) [2025-03-08 10:58:05,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3783 states and 5974 transitions. [2025-03-08 10:58:05,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-08 10:58:05,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:05,462 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:58:05,471 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-08 10:58:05,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:58:05,667 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:05,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:05,667 INFO L85 PathProgramCache]: Analyzing trace with hash -239749937, now seen corresponding path program 1 times [2025-03-08 10:58:05,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:05,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903151931] [2025-03-08 10:58:05,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:05,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:05,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-08 10:58:05,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-08 10:58:05,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:05,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 231 proven. 201 refuted. 0 times theorem prover too weak. 10372 trivial. 0 not checked. [2025-03-08 10:58:06,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:06,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903151931] [2025-03-08 10:58:06,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903151931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:58:06,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935790043] [2025-03-08 10:58:06,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:06,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:58:06,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:58:06,406 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-08 10:58:06,407 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-08 10:58:06,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-08 10:58:06,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-08 10:58:06,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:06,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:06,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 10:58:06,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:58:07,595 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 7085 proven. 309 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2025-03-08 10:58:07,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:58:09,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 330 proven. 318 refuted. 0 times theorem prover too weak. 10156 trivial. 0 not checked. [2025-03-08 10:58:09,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935790043] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:58:09,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:58:09,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 28 [2025-03-08 10:58:09,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423163172] [2025-03-08 10:58:09,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:58:09,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 10:58:09,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:09,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 10:58:09,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2025-03-08 10:58:09,222 INFO L87 Difference]: Start difference. First operand 3783 states and 5974 transitions. Second operand has 28 states, 28 states have (on average 8.642857142857142) internal successors, (242), 28 states have internal predecessors, (242), 9 states have call successors, (164), 4 states have call predecessors, (164), 9 states have return successors, (166), 9 states have call predecessors, (166), 9 states have call successors, (166) [2025-03-08 10:58:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:18,706 INFO L93 Difference]: Finished difference Result 33799 states and 51944 transitions. [2025-03-08 10:58:18,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2025-03-08 10:58:18,706 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.642857142857142) internal successors, (242), 28 states have internal predecessors, (242), 9 states have call successors, (164), 4 states have call predecessors, (164), 9 states have return successors, (166), 9 states have call predecessors, (166), 9 states have call successors, (166) Word has length 470 [2025-03-08 10:58:18,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:18,780 INFO L225 Difference]: With dead ends: 33799 [2025-03-08 10:58:18,780 INFO L226 Difference]: Without dead ends: 30071 [2025-03-08 10:58:18,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1102 GetRequests, 939 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10643 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5349, Invalid=21711, Unknown=0, NotChecked=0, Total=27060 [2025-03-08 10:58:18,800 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 6850 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 2633 mSolverCounterSat, 3566 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6850 SdHoareTripleChecker+Valid, 2107 SdHoareTripleChecker+Invalid, 6199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3566 IncrementalHoareTripleChecker+Valid, 2633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:18,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6850 Valid, 2107 Invalid, 6199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3566 Valid, 2633 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 10:58:18,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30071 states. [2025-03-08 10:58:20,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30071 to 10997. [2025-03-08 10:58:20,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10997 states, 8290 states have (on average 1.4209891435464415) internal successors, (11780), 8385 states have internal predecessors, (11780), 2411 states have call successors, (2411), 295 states have call predecessors, (2411), 295 states have return successors, (2411), 2316 states have call predecessors, (2411), 2411 states have call successors, (2411) [2025-03-08 10:58:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10997 states to 10997 states and 16602 transitions. [2025-03-08 10:58:20,268 INFO L78 Accepts]: Start accepts. Automaton has 10997 states and 16602 transitions. Word has length 470 [2025-03-08 10:58:20,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:20,269 INFO L471 AbstractCegarLoop]: Abstraction has 10997 states and 16602 transitions. [2025-03-08 10:58:20,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.642857142857142) internal successors, (242), 28 states have internal predecessors, (242), 9 states have call successors, (164), 4 states have call predecessors, (164), 9 states have return successors, (166), 9 states have call predecessors, (166), 9 states have call successors, (166) [2025-03-08 10:58:20,269 INFO L276 IsEmpty]: Start isEmpty. Operand 10997 states and 16602 transitions. [2025-03-08 10:58:20,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-08 10:58:20,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:20,323 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:58:20,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 10:58:20,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 10:58:20,523 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:20,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:20,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1983840059, now seen corresponding path program 1 times [2025-03-08 10:58:20,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:20,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182619252] [2025-03-08 10:58:20,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:20,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:20,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-08 10:58:20,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-08 10:58:20,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:20,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 354 proven. 486 refuted. 0 times theorem prover too weak. 9964 trivial. 0 not checked. [2025-03-08 10:58:22,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:22,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182619252] [2025-03-08 10:58:22,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182619252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:58:22,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937066941] [2025-03-08 10:58:22,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:22,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:58:22,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:58:22,600 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-08 10:58:22,601 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-08 10:58:22,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-08 10:58:22,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-08 10:58:22,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:22,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:22,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 10:58:22,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:58:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 6085 proven. 486 refuted. 0 times theorem prover too weak. 4233 trivial. 0 not checked. [2025-03-08 10:58:24,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:58:28,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937066941] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:58:28,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 10:58:28,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 28 [2025-03-08 10:58:28,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675825310] [2025-03-08 10:58:28,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 10:58:28,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 10:58:28,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:28,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 10:58:28,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 10:58:28,361 INFO L87 Difference]: Start difference. First operand 10997 states and 16602 transitions. Second operand has 28 states, 26 states have (on average 7.230769230769231) internal successors, (188), 28 states have internal predecessors, (188), 9 states have call successors, (121), 5 states have call predecessors, (121), 8 states have return successors, (121), 8 states have call predecessors, (121), 9 states have call successors, (121)