./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-11.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 8ae218ca02b5417943c2f14caa583f12c89b5725c70ee83be125986bc0e82f29 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:22:59,332 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:22:59,393 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:22:59,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:22:59,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:22:59,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:22:59,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:22:59,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:22:59,421 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:22:59,421 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:22:59,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:22:59,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:22:59,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:22:59,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:22:59,422 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:22:59,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:22:59,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:22:59,422 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:22:59,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:22:59,422 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:22:59,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:22:59,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:22:59,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:22:59,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:22:59,423 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:22:59,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:22:59,423 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:22:59,423 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:22:59,423 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:22:59,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:22:59,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:22:59,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:22:59,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:22:59,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:22:59,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:22:59,423 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:22:59,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:22:59,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:22:59,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:22:59,423 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:22:59,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:22:59,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:22:59,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:22:59,423 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 -> 8ae218ca02b5417943c2f14caa583f12c89b5725c70ee83be125986bc0e82f29 [2025-03-03 21:22:59,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:22:59,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:22:59,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:22:59,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:22:59,664 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:22:59,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-11.i [2025-03-03 21:23:00,753 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad1438e29/a2df47b8ad2c4948ba4bd398cc6d7733/FLAG9636ab8a9 [2025-03-03 21:23:00,997 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:23:00,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-11.i [2025-03-03 21:23:01,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad1438e29/a2df47b8ad2c4948ba4bd398cc6d7733/FLAG9636ab8a9 [2025-03-03 21:23:01,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad1438e29/a2df47b8ad2c4948ba4bd398cc6d7733 [2025-03-03 21:23:01,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:23:01,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:23:01,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:23:01,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:23:01,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:23:01,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:23:01" (1/1) ... [2025-03-03 21:23:01,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55bee783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:01, skipping insertion in model container [2025-03-03 21:23:01,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:23:01" (1/1) ... [2025-03-03 21:23:01,055 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:23:01,160 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_fillercodestructure_filler-pr-co_file-11.i[919,932] [2025-03-03 21:23:01,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:23:01,234 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:23:01,242 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_fillercodestructure_filler-pr-co_file-11.i[919,932] [2025-03-03 21:23:01,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:23:01,275 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:23:01,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:01 WrapperNode [2025-03-03 21:23:01,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:23:01,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:23:01,277 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:23:01,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:23:01,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:01" (1/1) ... [2025-03-03 21:23:01,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:01" (1/1) ... [2025-03-03 21:23:01,303 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2025-03-03 21:23:01,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:23:01,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:23:01,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:23:01,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:23:01,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:01" (1/1) ... [2025-03-03 21:23:01,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:01" (1/1) ... [2025-03-03 21:23:01,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:01" (1/1) ... [2025-03-03 21:23:01,322 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:23:01,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:01" (1/1) ... [2025-03-03 21:23:01,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:01" (1/1) ... [2025-03-03 21:23:01,328 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:01" (1/1) ... [2025-03-03 21:23:01,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:01" (1/1) ... [2025-03-03 21:23:01,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:01" (1/1) ... [2025-03-03 21:23:01,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:01" (1/1) ... [2025-03-03 21:23:01,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:23:01,336 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:23:01,336 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:23:01,336 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:23:01,337 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:01" (1/1) ... [2025-03-03 21:23:01,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:23:01,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:23:01,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:23:01,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:23:01,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:23:01,377 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:23:01,377 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:23:01,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:23:01,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:23:01,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:23:01,436 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:23:01,438 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:23:01,704 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-03 21:23:01,704 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:23:01,719 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:23:01,719 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-03 21:23:01,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:23:01 BoogieIcfgContainer [2025-03-03 21:23:01,720 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:23:01,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:23:01,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:23:01,725 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:23:01,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:23:01" (1/3) ... [2025-03-03 21:23:01,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ebb4e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:23:01, skipping insertion in model container [2025-03-03 21:23:01,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:01" (2/3) ... [2025-03-03 21:23:01,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ebb4e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:23:01, skipping insertion in model container [2025-03-03 21:23:01,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:23:01" (3/3) ... [2025-03-03 21:23:01,726 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-11.i [2025-03-03 21:23:01,736 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:23:01,737 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-11.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:23:01,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:23:01,786 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;@69401aa4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:23:01,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:23:01,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 63 states have internal predecessors, (92), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 21:23:01,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 21:23:01,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:23:01,799 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:23:01,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:23:01,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:23:01,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1587419270, now seen corresponding path program 1 times [2025-03-03 21:23:01,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:23:01,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606935029] [2025-03-03 21:23:01,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:23:01,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:23:01,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 21:23:01,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 21:23:01,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:23:01,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:23:02,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-03 21:23:02,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:23:02,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606935029] [2025-03-03 21:23:02,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606935029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:23:02,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756075908] [2025-03-03 21:23:02,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:23:02,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:23:02,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:23:02,096 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:23:02,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:23:02,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 21:23:02,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 21:23:02,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:23:02,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:23:02,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:23:02,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:23:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-03 21:23:02,310 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:23:02,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756075908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:23:02,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:23:02,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:23:02,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032838806] [2025-03-03 21:23:02,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:23:02,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:23:02,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:23:02,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:23:02,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:23:02,330 INFO L87 Difference]: Start difference. First operand has 92 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 63 states have internal predecessors, (92), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 21:23:02,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:23:02,362 INFO L93 Difference]: Finished difference Result 178 states and 314 transitions. [2025-03-03 21:23:02,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:23:02,365 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 173 [2025-03-03 21:23:02,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:23:02,372 INFO L225 Difference]: With dead ends: 178 [2025-03-03 21:23:02,372 INFO L226 Difference]: Without dead ends: 89 [2025-03-03 21:23:02,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:23:02,376 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:23:02,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:23:02,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-03 21:23:02,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-03 21:23:02,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 21:23:02,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 140 transitions. [2025-03-03 21:23:02,410 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 140 transitions. Word has length 173 [2025-03-03 21:23:02,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:23:02,411 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 140 transitions. [2025-03-03 21:23:02,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 21:23:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 140 transitions. [2025-03-03 21:23:02,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 21:23:02,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:23:02,415 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:23:02,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 21:23:02,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 21:23:02,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:23:02,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:23:02,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1013522583, now seen corresponding path program 1 times [2025-03-03 21:23:02,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:23:02,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248803954] [2025-03-03 21:23:02,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:23:02,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:23:02,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 21:23:02,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 21:23:02,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:23:02,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:23:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:23:03,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:23:03,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248803954] [2025-03-03 21:23:03,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248803954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:23:03,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:23:03,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:23:03,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249112083] [2025-03-03 21:23:03,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:23:03,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:23:03,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:23:03,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:23:03,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:23:03,468 INFO L87 Difference]: Start difference. First operand 89 states and 140 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:23:03,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:23:03,545 INFO L93 Difference]: Finished difference Result 203 states and 320 transitions. [2025-03-03 21:23:03,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:23:03,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 173 [2025-03-03 21:23:03,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:23:03,549 INFO L225 Difference]: With dead ends: 203 [2025-03-03 21:23:03,549 INFO L226 Difference]: Without dead ends: 117 [2025-03-03 21:23:03,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:23:03,550 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 122 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:23:03,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 284 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:23:03,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-03 21:23:03,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2025-03-03 21:23:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 74 states have internal predecessors, (108), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 21:23:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 162 transitions. [2025-03-03 21:23:03,567 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 162 transitions. Word has length 173 [2025-03-03 21:23:03,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:23:03,569 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 162 transitions. [2025-03-03 21:23:03,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:23:03,569 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 162 transitions. [2025-03-03 21:23:03,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 21:23:03,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:23:03,573 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:23:03,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:23:03,573 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:23:03,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:23:03,574 INFO L85 PathProgramCache]: Analyzing trace with hash -793931880, now seen corresponding path program 1 times [2025-03-03 21:23:03,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:23:03,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36388092] [2025-03-03 21:23:03,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:23:03,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:23:03,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 21:23:03,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 21:23:03,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:23:03,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:23:03,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:23:03,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:23:03,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36388092] [2025-03-03 21:23:03,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36388092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:23:03,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:23:03,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:23:03,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106096221] [2025-03-03 21:23:03,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:23:03,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:23:03,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:23:03,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:23:03,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:23:03,841 INFO L87 Difference]: Start difference. First operand 103 states and 162 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:23:04,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:23:04,077 INFO L93 Difference]: Finished difference Result 304 states and 481 transitions. [2025-03-03 21:23:04,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:23:04,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 173 [2025-03-03 21:23:04,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:23:04,080 INFO L225 Difference]: With dead ends: 304 [2025-03-03 21:23:04,081 INFO L226 Difference]: Without dead ends: 204 [2025-03-03 21:23:04,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:23:04,083 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 102 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:23:04,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 459 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:23:04,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-03 21:23:04,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 152. [2025-03-03 21:23:04,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 21:23:04,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 237 transitions. [2025-03-03 21:23:04,112 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 237 transitions. Word has length 173 [2025-03-03 21:23:04,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:23:04,112 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 237 transitions. [2025-03-03 21:23:04,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:23:04,113 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 237 transitions. [2025-03-03 21:23:04,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 21:23:04,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:23:04,114 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:23:04,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:23:04,114 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:23:04,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:23:04,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1471341513, now seen corresponding path program 1 times [2025-03-03 21:23:04,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:23:04,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995425872] [2025-03-03 21:23:04,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:23:04,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:23:04,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 21:23:04,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 21:23:04,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:23:04,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:23:04,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:23:04,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:23:04,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995425872] [2025-03-03 21:23:04,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995425872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:23:04,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:23:04,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:23:04,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475941743] [2025-03-03 21:23:04,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:23:04,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:23:04,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:23:04,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:23:04,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:23:04,567 INFO L87 Difference]: Start difference. First operand 152 states and 237 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:23:04,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:23:04,882 INFO L93 Difference]: Finished difference Result 420 states and 661 transitions. [2025-03-03 21:23:04,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:23:04,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2025-03-03 21:23:04,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:23:04,885 INFO L225 Difference]: With dead ends: 420 [2025-03-03 21:23:04,885 INFO L226 Difference]: Without dead ends: 320 [2025-03-03 21:23:04,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:23:04,887 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 152 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:23:04,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 383 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:23:04,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-03 21:23:04,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 257. [2025-03-03 21:23:04,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 172 states have (on average 1.4244186046511629) internal successors, (245), 172 states have internal predecessors, (245), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 21:23:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 407 transitions. [2025-03-03 21:23:04,922 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 407 transitions. Word has length 174 [2025-03-03 21:23:04,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:23:04,922 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 407 transitions. [2025-03-03 21:23:04,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:23:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 407 transitions. [2025-03-03 21:23:04,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 21:23:04,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:23:04,925 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:23:04,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:23:04,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:23:04,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:23:04,926 INFO L85 PathProgramCache]: Analyzing trace with hash 162486535, now seen corresponding path program 1 times [2025-03-03 21:23:04,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:23:04,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953864191] [2025-03-03 21:23:04,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:23:04,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:23:04,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 21:23:05,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 21:23:05,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:23:05,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:23:05,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-03-03 21:23:05,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:23:05,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953864191] [2025-03-03 21:23:05,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953864191] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:23:05,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117368501] [2025-03-03 21:23:05,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:23:05,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:23:05,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:23:05,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:23:05,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 21:23:05,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 21:23:05,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 21:23:05,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:23:05,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:23:05,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 21:23:05,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:23:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 308 proven. 69 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2025-03-03 21:23:06,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:23:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-03-03 21:23:06,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117368501] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:23:06,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:23:06,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2025-03-03 21:23:06,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877837233] [2025-03-03 21:23:06,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:23:06,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 21:23:06,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:23:06,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 21:23:06,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:23:06,394 INFO L87 Difference]: Start difference. First operand 257 states and 407 transitions. Second operand has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) [2025-03-03 21:23:06,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:23:06,626 INFO L93 Difference]: Finished difference Result 455 states and 708 transitions. [2025-03-03 21:23:06,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 21:23:06,626 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) Word has length 175 [2025-03-03 21:23:06,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:23:06,629 INFO L225 Difference]: With dead ends: 455 [2025-03-03 21:23:06,630 INFO L226 Difference]: Without dead ends: 250 [2025-03-03 21:23:06,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 343 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:23:06,631 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 287 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:23:06,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 305 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:23:06,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-03 21:23:06,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2025-03-03 21:23:06,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 150 states have internal predecessors, (196), 81 states have call successors, (81), 6 states have call predecessors, (81), 6 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 21:23:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 358 transitions. [2025-03-03 21:23:06,662 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 358 transitions. Word has length 175 [2025-03-03 21:23:06,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:23:06,662 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 358 transitions. [2025-03-03 21:23:06,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) [2025-03-03 21:23:06,663 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 358 transitions. [2025-03-03 21:23:06,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 21:23:06,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:23:06,664 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:23:06,671 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-03 21:23:06,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:23:06,865 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:23:06,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:23:06,865 INFO L85 PathProgramCache]: Analyzing trace with hash -872892555, now seen corresponding path program 1 times [2025-03-03 21:23:06,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:23:06,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681619342] [2025-03-03 21:23:06,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:23:06,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:23:06,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 21:23:06,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 21:23:06,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:23:06,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:23:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 33 proven. 45 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-03-03 21:23:10,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:23:10,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681619342] [2025-03-03 21:23:10,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681619342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:23:10,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086128798] [2025-03-03 21:23:10,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:23:10,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:23:10,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:23:10,831 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:23:10,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 21:23:10,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 21:23:10,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 21:23:10,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:23:10,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:23:10,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-03 21:23:10,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:23:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 591 proven. 288 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-03-03 21:23:14,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:23:56,224 WARN L286 SmtUtils]: Spent 9.27s on a formula simplification. DAG size of input: 141 DAG size of output: 139 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 21:23:56,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086128798] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:23:56,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:23:56,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 28] total 41 [2025-03-03 21:23:56,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097786179] [2025-03-03 21:23:56,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:23:56,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-03 21:23:56,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:23:56,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-03 21:23:56,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=2811, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 21:23:56,230 INFO L87 Difference]: Start difference. First operand 238 states and 358 transitions. Second operand has 41 states, 40 states have (on average 2.625) internal successors, (105), 38 states have internal predecessors, (105), 11 states have call successors, (54), 8 states have call predecessors, (54), 10 states have return successors, (54), 11 states have call predecessors, (54), 11 states have call successors, (54) [2025-03-03 21:24:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:24:19,352 INFO L93 Difference]: Finished difference Result 1284 states and 1800 transitions. [2025-03-03 21:24:19,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2025-03-03 21:24:19,353 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.625) internal successors, (105), 38 states have internal predecessors, (105), 11 states have call successors, (54), 8 states have call predecessors, (54), 10 states have return successors, (54), 11 states have call predecessors, (54), 11 states have call successors, (54) Word has length 175 [2025-03-03 21:24:19,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:24:19,361 INFO L225 Difference]: With dead ends: 1284 [2025-03-03 21:24:19,362 INFO L226 Difference]: Without dead ends: 1102 [2025-03-03 21:24:19,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8745 ImplicationChecksByTransitivity, 44.1s TimeCoverageRelationStatistics Valid=4132, Invalid=22928, Unknown=0, NotChecked=0, Total=27060 [2025-03-03 21:24:19,368 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 2438 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 2873 mSolverCounterSat, 628 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2440 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 3501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 628 IncrementalHoareTripleChecker+Valid, 2873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:24:19,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2440 Valid, 1548 Invalid, 3501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [628 Valid, 2873 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-03-03 21:24:19,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2025-03-03 21:24:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 435. [2025-03-03 21:24:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 294 states have (on average 1.2653061224489797) internal successors, (372), 296 states have internal predecessors, (372), 114 states have call successors, (114), 26 states have call predecessors, (114), 26 states have return successors, (114), 112 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-03 21:24:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 600 transitions. [2025-03-03 21:24:19,437 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 600 transitions. Word has length 175 [2025-03-03 21:24:19,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:24:19,438 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 600 transitions. [2025-03-03 21:24:19,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.625) internal successors, (105), 38 states have internal predecessors, (105), 11 states have call successors, (54), 8 states have call predecessors, (54), 10 states have return successors, (54), 11 states have call predecessors, (54), 11 states have call successors, (54) [2025-03-03 21:24:19,438 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 600 transitions. [2025-03-03 21:24:19,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 21:24:19,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:24:19,439 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:24:19,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 21:24:19,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:24:19,644 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:24:19,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:24:19,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1594564950, now seen corresponding path program 1 times [2025-03-03 21:24:19,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:24:19,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195299120] [2025-03-03 21:24:19,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:24:19,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:24:19,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 21:24:19,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 21:24:19,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:24:19,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:24:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:24:23,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:24:23,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195299120] [2025-03-03 21:24:23,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195299120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:24:23,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:24:23,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 21:24:23,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936202662] [2025-03-03 21:24:23,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:24:23,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 21:24:23,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:24:23,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 21:24:23,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:24:23,762 INFO L87 Difference]: Start difference. First operand 435 states and 600 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 5 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 5 states have call predecessors, (27), 5 states have call successors, (27) [2025-03-03 21:24:29,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:24:29,456 INFO L93 Difference]: Finished difference Result 823 states and 1126 transitions. [2025-03-03 21:24:29,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 21:24:29,457 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 5 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 5 states have call predecessors, (27), 5 states have call successors, (27) Word has length 176 [2025-03-03 21:24:29,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:24:29,461 INFO L225 Difference]: With dead ends: 823 [2025-03-03 21:24:29,462 INFO L226 Difference]: Without dead ends: 717 [2025-03-03 21:24:29,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2025-03-03 21:24:29,463 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 804 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:24:29,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 578 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 21:24:29,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-03-03 21:24:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 417. [2025-03-03 21:24:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 294 states have (on average 1.2789115646258504) internal successors, (376), 296 states have internal predecessors, (376), 95 states have call successors, (95), 27 states have call predecessors, (95), 27 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-03 21:24:29,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 566 transitions. [2025-03-03 21:24:29,547 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 566 transitions. Word has length 176 [2025-03-03 21:24:29,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:24:29,548 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 566 transitions. [2025-03-03 21:24:29,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 5 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 5 states have call predecessors, (27), 5 states have call successors, (27) [2025-03-03 21:24:29,548 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 566 transitions. [2025-03-03 21:24:29,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 21:24:29,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:24:29,549 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:24:29,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:24:29,549 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:24:29,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:24:29,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1534535049, now seen corresponding path program 1 times [2025-03-03 21:24:29,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:24:29,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692915886] [2025-03-03 21:24:29,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:24:29,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:24:29,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 21:24:29,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 21:24:29,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:24:29,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat