./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-52.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_codestructure_steplocals_file-52.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 b3efc8bcbadceefc0e89c7f5ec8b215e038042a2520cfba55c9b27a207b32e90 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:03:05,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:03:05,370 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:03:05,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:03:05,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:03:05,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:03:05,393 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:03:05,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:03:05,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:03:05,394 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:03:05,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:03:05,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:03:05,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:03:05,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:03:05,395 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:03:05,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:03:05,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:03:05,395 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:03:05,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:03:05,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:03:05,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:03:05,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:03:05,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:03:05,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:03:05,396 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:03:05,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:03:05,396 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:03:05,396 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:03:05,396 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:03:05,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:03:05,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:03:05,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:03:05,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:03:05,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:03:05,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:03:05,397 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:03:05,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:03:05,397 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:03:05,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:03:05,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:03:05,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:03:05,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:03:05,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:03:05,398 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 -> b3efc8bcbadceefc0e89c7f5ec8b215e038042a2520cfba55c9b27a207b32e90 [2025-03-03 19:03:05,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:03:05,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:03:05,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:03:05,621 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:03:05,621 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:03:05,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-52.i [2025-03-03 19:03:06,751 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b83a6d730/6863b7722c59456c8487eb0154181fac/FLAG85224c618 [2025-03-03 19:03:07,028 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:03:07,029 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-52.i [2025-03-03 19:03:07,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b83a6d730/6863b7722c59456c8487eb0154181fac/FLAG85224c618 [2025-03-03 19:03:07,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b83a6d730/6863b7722c59456c8487eb0154181fac [2025-03-03 19:03:07,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:03:07,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:03:07,058 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:03:07,058 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:03:07,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:03:07,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:03:07" (1/1) ... [2025-03-03 19:03:07,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7783aab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:03:07, skipping insertion in model container [2025-03-03 19:03:07,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:03:07" (1/1) ... [2025-03-03 19:03:07,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:03:07,171 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_codestructure_steplocals_file-52.i[917,930] [2025-03-03 19:03:07,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:03:07,216 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:03:07,222 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_codestructure_steplocals_file-52.i[917,930] [2025-03-03 19:03:07,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:03:07,252 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:03:07,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:03:07 WrapperNode [2025-03-03 19:03:07,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:03:07,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:03:07,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:03:07,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:03:07,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:03:07" (1/1) ... [2025-03-03 19:03:07,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:03:07" (1/1) ... [2025-03-03 19:03:07,283 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2025-03-03 19:03:07,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:03:07,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:03:07,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:03:07,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:03:07,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:03:07" (1/1) ... [2025-03-03 19:03:07,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:03:07" (1/1) ... [2025-03-03 19:03:07,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:03:07" (1/1) ... [2025-03-03 19:03:07,308 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 19:03:07,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:03:07" (1/1) ... [2025-03-03 19:03:07,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:03:07" (1/1) ... [2025-03-03 19:03:07,313 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:03:07" (1/1) ... [2025-03-03 19:03:07,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:03:07" (1/1) ... [2025-03-03 19:03:07,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:03:07" (1/1) ... [2025-03-03 19:03:07,322 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:03:07" (1/1) ... [2025-03-03 19:03:07,324 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:03:07,326 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:03:07,326 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:03:07,327 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:03:07,328 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:03:07" (1/1) ... [2025-03-03 19:03:07,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:03:07,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:03:07,354 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 19:03:07,357 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 19:03:07,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:03:07,374 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:03:07,374 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:03:07,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:03:07,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:03:07,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:03:07,428 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:03:07,429 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:03:07,724 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-03 19:03:07,725 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:03:07,732 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:03:07,733 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:03:07,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:03:07 BoogieIcfgContainer [2025-03-03 19:03:07,734 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:03:07,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:03:07,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:03:07,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:03:07,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:03:07" (1/3) ... [2025-03-03 19:03:07,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a35ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:03:07, skipping insertion in model container [2025-03-03 19:03:07,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:03:07" (2/3) ... [2025-03-03 19:03:07,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a35ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:03:07, skipping insertion in model container [2025-03-03 19:03:07,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:03:07" (3/3) ... [2025-03-03 19:03:07,741 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-52.i [2025-03-03 19:03:07,750 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:03:07,751 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-52.i that has 2 procedures, 69 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:03:07,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:03:07,798 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;@88e6913, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:03:07,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:03:07,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 19:03:07,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 19:03:07,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:03:07,811 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:03:07,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:03:07,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:03:07,815 INFO L85 PathProgramCache]: Analyzing trace with hash -669815492, now seen corresponding path program 1 times [2025-03-03 19:03:07,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:03:07,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015444868] [2025-03-03 19:03:07,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:03:07,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:03:07,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 19:03:08,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 19:03:08,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:03:08,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:03:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 19:03:23,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:03:23,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015444868] [2025-03-03 19:03:23,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015444868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:03:23,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:03:23,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 19:03:23,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431206920] [2025-03-03 19:03:23,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:03:23,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 19:03:23,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:03:23,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 19:03:23,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2025-03-03 19:03:23,141 INFO L87 Difference]: Start difference. First operand has 69 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 19:03:25,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:03:25,142 INFO L93 Difference]: Finished difference Result 173 states and 284 transitions. [2025-03-03 19:03:25,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 19:03:25,144 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 152 [2025-03-03 19:03:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:03:25,149 INFO L225 Difference]: With dead ends: 173 [2025-03-03 19:03:25,149 INFO L226 Difference]: Without dead ends: 107 [2025-03-03 19:03:25,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2025-03-03 19:03:25,155 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 151 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:03:25,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 417 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 19:03:25,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-03 19:03:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 80. [2025-03-03 19:03:25,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 19:03:25,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 119 transitions. [2025-03-03 19:03:25,189 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 119 transitions. Word has length 152 [2025-03-03 19:03:25,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:03:25,192 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 119 transitions. [2025-03-03 19:03:25,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 19:03:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 119 transitions. [2025-03-03 19:03:25,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 19:03:25,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:03:25,197 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:03:25,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 19:03:25,197 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:03:25,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:03:25,198 INFO L85 PathProgramCache]: Analyzing trace with hash -641186341, now seen corresponding path program 1 times [2025-03-03 19:03:25,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:03:25,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589461746] [2025-03-03 19:03:25,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:03:25,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:03:25,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 19:03:25,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 19:03:25,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:03:25,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:03:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 19:03:36,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:03:36,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589461746] [2025-03-03 19:03:36,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589461746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:03:36,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:03:36,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 19:03:36,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650682525] [2025-03-03 19:03:36,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:03:36,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 19:03:36,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:03:36,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 19:03:36,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2025-03-03 19:03:36,843 INFO L87 Difference]: Start difference. First operand 80 states and 119 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 19:03:39,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:03:39,888 INFO L93 Difference]: Finished difference Result 107 states and 150 transitions. [2025-03-03 19:03:39,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 19:03:39,889 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 152 [2025-03-03 19:03:39,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:03:39,890 INFO L225 Difference]: With dead ends: 107 [2025-03-03 19:03:39,890 INFO L226 Difference]: Without dead ends: 105 [2025-03-03 19:03:39,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=143, Invalid=277, Unknown=0, NotChecked=0, Total=420 [2025-03-03 19:03:39,891 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 93 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 19:03:39,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 510 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 19:03:39,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-03 19:03:39,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 80. [2025-03-03 19:03:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 19:03:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 119 transitions. [2025-03-03 19:03:39,900 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 119 transitions. Word has length 152 [2025-03-03 19:03:39,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:03:39,900 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 119 transitions. [2025-03-03 19:03:39,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 19:03:39,900 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 119 transitions. [2025-03-03 19:03:39,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 19:03:39,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:03:39,905 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:03:39,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:03:39,905 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:03:39,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:03:39,906 INFO L85 PathProgramCache]: Analyzing trace with hash -164256867, now seen corresponding path program 1 times [2025-03-03 19:03:39,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:03:39,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464745730] [2025-03-03 19:03:39,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:03:39,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:03:39,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 19:03:39,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 19:03:39,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:03:39,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:03:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 19:03:50,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:03:50,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464745730] [2025-03-03 19:03:50,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464745730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:03:50,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:03:50,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 19:03:50,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970093038] [2025-03-03 19:03:50,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:03:50,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 19:03:50,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:03:50,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 19:03:50,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-03 19:03:50,115 INFO L87 Difference]: Start difference. First operand 80 states and 119 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 19:03:52,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:03:52,714 INFO L93 Difference]: Finished difference Result 134 states and 184 transitions. [2025-03-03 19:03:52,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 19:03:52,719 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 152 [2025-03-03 19:03:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:03:52,720 INFO L225 Difference]: With dead ends: 134 [2025-03-03 19:03:52,720 INFO L226 Difference]: Without dead ends: 132 [2025-03-03 19:03:52,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-03 19:03:52,721 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 80 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:03:52,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 743 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 19:03:52,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-03 19:03:52,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 89. [2025-03-03 19:03:52,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 19:03:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 133 transitions. [2025-03-03 19:03:52,729 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 133 transitions. Word has length 152 [2025-03-03 19:03:52,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:03:52,729 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 133 transitions. [2025-03-03 19:03:52,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 19:03:52,729 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 133 transitions. [2025-03-03 19:03:52,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 19:03:52,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:03:52,733 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:03:52,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:03:52,733 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:03:52,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:03:52,734 INFO L85 PathProgramCache]: Analyzing trace with hash -135627716, now seen corresponding path program 1 times [2025-03-03 19:03:52,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:03:52,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410589529] [2025-03-03 19:03:52,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:03:52,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:03:52,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 19:03:52,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 19:03:52,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:03:52,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:04:02,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 19:04:02,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:04:02,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410589529] [2025-03-03 19:04:02,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410589529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:04:02,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:04:02,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 19:04:02,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523983313] [2025-03-03 19:04:02,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:04:02,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 19:04:02,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:04:02,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 19:04:02,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-03 19:04:02,072 INFO L87 Difference]: Start difference. First operand 89 states and 133 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 19:04:05,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:04:05,202 INFO L93 Difference]: Finished difference Result 132 states and 182 transitions. [2025-03-03 19:04:05,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 19:04:05,203 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 152 [2025-03-03 19:04:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:04:05,204 INFO L225 Difference]: With dead ends: 132 [2025-03-03 19:04:05,204 INFO L226 Difference]: Without dead ends: 130 [2025-03-03 19:04:05,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2025-03-03 19:04:05,206 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 98 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 19:04:05,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 733 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 19:04:05,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-03 19:04:05,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 85. [2025-03-03 19:04:05,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 59 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 19:04:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2025-03-03 19:04:05,216 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 152 [2025-03-03 19:04:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:04:05,216 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2025-03-03 19:04:05,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 19:04:05,216 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2025-03-03 19:04:05,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 19:04:05,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:04:05,220 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:04:05,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:04:05,220 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:04:05,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:04:05,220 INFO L85 PathProgramCache]: Analyzing trace with hash 332177692, now seen corresponding path program 1 times [2025-03-03 19:04:05,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:04:05,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729443285] [2025-03-03 19:04:05,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:04:05,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:04:05,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 19:04:05,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 19:04:05,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:05,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:04:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 19:04:10,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:04:10,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729443285] [2025-03-03 19:04:10,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729443285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:04:10,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:04:10,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 19:04:10,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126351049] [2025-03-03 19:04:10,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:04:10,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 19:04:10,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:04:10,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 19:04:10,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-03 19:04:10,130 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 19:04:14,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:04:14,302 INFO L93 Difference]: Finished difference Result 220 states and 317 transitions. [2025-03-03 19:04:14,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 19:04:14,302 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 152 [2025-03-03 19:04:14,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:04:14,304 INFO L225 Difference]: With dead ends: 220 [2025-03-03 19:04:14,304 INFO L226 Difference]: Without dead ends: 138 [2025-03-03 19:04:14,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2025-03-03 19:04:14,305 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 140 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:04:14,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 665 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 19:04:14,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-03 19:04:14,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 95. [2025-03-03 19:04:14,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 19:04:14,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 141 transitions. [2025-03-03 19:04:14,313 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 141 transitions. Word has length 152 [2025-03-03 19:04:14,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:04:14,313 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 141 transitions. [2025-03-03 19:04:14,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 19:04:14,313 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2025-03-03 19:04:14,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 19:04:14,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:04:14,314 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:04:14,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:04:14,315 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:04:14,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:04:14,315 INFO L85 PathProgramCache]: Analyzing trace with hash 360806843, now seen corresponding path program 1 times [2025-03-03 19:04:14,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:04:14,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018022046] [2025-03-03 19:04:14,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:04:14,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:04:14,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 19:04:14,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 19:04:14,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:14,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:04:19,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 19:04:19,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:04:19,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018022046] [2025-03-03 19:04:19,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018022046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:04:19,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:04:19,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 19:04:19,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106815743] [2025-03-03 19:04:19,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:04:19,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 19:04:19,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:04:19,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 19:04:19,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-03 19:04:19,427 INFO L87 Difference]: Start difference. First operand 95 states and 141 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 19:04:24,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:04:24,744 INFO L93 Difference]: Finished difference Result 140 states and 192 transitions. [2025-03-03 19:04:24,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 19:04:24,745 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 152 [2025-03-03 19:04:24,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:04:24,746 INFO L225 Difference]: With dead ends: 140 [2025-03-03 19:04:24,746 INFO L226 Difference]: Without dead ends: 138 [2025-03-03 19:04:24,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2025-03-03 19:04:24,748 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 108 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:04:24,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 673 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 19:04:24,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-03 19:04:24,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 91. [2025-03-03 19:04:24,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 19:04:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 135 transitions. [2025-03-03 19:04:24,755 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 135 transitions. Word has length 152 [2025-03-03 19:04:24,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:04:24,755 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 135 transitions. [2025-03-03 19:04:24,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 19:04:24,756 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 135 transitions. [2025-03-03 19:04:24,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 19:04:24,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:04:24,757 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:04:24,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:04:24,757 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:04:24,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:04:24,757 INFO L85 PathProgramCache]: Analyzing trace with hash -173380933, now seen corresponding path program 1 times [2025-03-03 19:04:24,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:04:24,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370004132] [2025-03-03 19:04:24,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:04:24,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:04:24,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 19:04:24,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 19:04:24,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:24,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:04:29,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 19:04:29,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:04:29,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370004132] [2025-03-03 19:04:29,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370004132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:04:29,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:04:29,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 19:04:29,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467412028] [2025-03-03 19:04:29,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:04:29,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 19:04:29,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:04:29,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 19:04:29,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-03 19:04:29,572 INFO L87 Difference]: Start difference. First operand 91 states and 135 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 19:04:33,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:04:33,401 INFO L93 Difference]: Finished difference Result 234 states and 332 transitions. [2025-03-03 19:04:33,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 19:04:33,402 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 152 [2025-03-03 19:04:33,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:04:33,403 INFO L225 Difference]: With dead ends: 234 [2025-03-03 19:04:33,403 INFO L226 Difference]: Without dead ends: 146 [2025-03-03 19:04:33,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2025-03-03 19:04:33,405 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 83 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:04:33,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 796 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 19:04:33,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-03 19:04:33,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 96. [2025-03-03 19:04:33,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 19:04:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 141 transitions. [2025-03-03 19:04:33,413 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 141 transitions. Word has length 152 [2025-03-03 19:04:33,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:04:33,414 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 141 transitions. [2025-03-03 19:04:33,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 19:04:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 141 transitions. [2025-03-03 19:04:33,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 19:04:33,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:04:33,416 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:04:33,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:04:33,416 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:04:33,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:04:33,416 INFO L85 PathProgramCache]: Analyzing trace with hash -144751782, now seen corresponding path program 1 times [2025-03-03 19:04:33,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:04:33,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528584710] [2025-03-03 19:04:33,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:04:33,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:04:33,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 19:04:33,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 19:04:33,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:33,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat