./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/bitvector/s3_srvr_3a_alt.BV.c.cil.c -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 c802d0dd4f8edaf03f1251784a424c8f295192f6a4e7c65ec93469eacce08251 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:03:28,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:03:28,488 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:03:28,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:03:28,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:03:28,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:03:28,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:03:28,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:03:28,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:03:28,509 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:03:28,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:03:28,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:03:28,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:03:28,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:03:28,509 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:03:28,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:03:28,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:03:28,510 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:03:28,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:03:28,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:03:28,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:03:28,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:03:28,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:03:28,510 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:03:28,510 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:03:28,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:03:28,511 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:03:28,511 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:03:28,511 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:03:28,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:03:28,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:03:28,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:03:28,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:03:28,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:03:28,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:03:28,512 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:03:28,512 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:03:28,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:03:28,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:03:28,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:03:28,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:03:28,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:03:28,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:03:28,512 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 -> c802d0dd4f8edaf03f1251784a424c8f295192f6a4e7c65ec93469eacce08251 [2025-03-16 14:03:28,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:03:28,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:03:28,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:03:28,734 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:03:28,735 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:03:28,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2025-03-16 14:03:29,874 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d8e68b28/158ef3e83e514bbf93088692d0b3ae8d/FLAG6294f5d61 [2025-03-16 14:03:30,106 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:03:30,108 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2025-03-16 14:03:30,119 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d8e68b28/158ef3e83e514bbf93088692d0b3ae8d/FLAG6294f5d61 [2025-03-16 14:03:30,439 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d8e68b28/158ef3e83e514bbf93088692d0b3ae8d [2025-03-16 14:03:30,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:03:30,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:03:30,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:03:30,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:03:30,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:03:30,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:03:30" (1/1) ... [2025-03-16 14:03:30,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49efd45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:30, skipping insertion in model container [2025-03-16 14:03:30,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:03:30" (1/1) ... [2025-03-16 14:03:30,473 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:03:30,595 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/bitvector/s3_srvr_3a_alt.BV.c.cil.c[44628,44641] [2025-03-16 14:03:30,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:03:30,612 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:03:30,649 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/bitvector/s3_srvr_3a_alt.BV.c.cil.c[44628,44641] [2025-03-16 14:03:30,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:03:30,658 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:03:30,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:30 WrapperNode [2025-03-16 14:03:30,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:03:30,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:03:30,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:03:30,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:03:30,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:30" (1/1) ... [2025-03-16 14:03:30,668 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:30" (1/1) ... [2025-03-16 14:03:30,691 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 653 [2025-03-16 14:03:30,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:03:30,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:03:30,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:03:30,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:03:30,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:30" (1/1) ... [2025-03-16 14:03:30,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:30" (1/1) ... [2025-03-16 14:03:30,701 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:30" (1/1) ... [2025-03-16 14:03:30,714 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-16 14:03:30,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:30" (1/1) ... [2025-03-16 14:03:30,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:30" (1/1) ... [2025-03-16 14:03:30,721 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:30" (1/1) ... [2025-03-16 14:03:30,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:30" (1/1) ... [2025-03-16 14:03:30,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:30" (1/1) ... [2025-03-16 14:03:30,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:30" (1/1) ... [2025-03-16 14:03:30,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:03:30,730 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:03:30,730 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:03:30,730 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:03:30,731 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:30" (1/1) ... [2025-03-16 14:03:30,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:03:30,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:30,757 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-16 14:03:30,760 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-16 14:03:30,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:03:30,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:03:30,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:03:30,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:03:30,856 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:03:30,857 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:03:31,324 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L219: assume false; [2025-03-16 14:03:31,325 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L219: assume !false; [2025-03-16 14:03:31,358 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-03-16 14:03:31,358 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:03:31,390 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:03:31,391 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:03:31,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:03:31 BoogieIcfgContainer [2025-03-16 14:03:31,391 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:03:31,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:03:31,394 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:03:31,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:03:31,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:03:30" (1/3) ... [2025-03-16 14:03:31,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44590d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:03:31, skipping insertion in model container [2025-03-16 14:03:31,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:30" (2/3) ... [2025-03-16 14:03:31,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44590d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:03:31, skipping insertion in model container [2025-03-16 14:03:31,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:03:31" (3/3) ... [2025-03-16 14:03:31,399 INFO L128 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2025-03-16 14:03:31,408 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:03:31,410 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s3_srvr_3a_alt.BV.c.cil.c that has 1 procedures, 167 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:03:31,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:03:31,481 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;@1e24d822, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:03:31,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:03:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 165 states have (on average 1.7393939393939395) internal successors, (287), 166 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:31,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 14:03:31,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:31,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:03:31,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:31,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:31,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1947855289, now seen corresponding path program 1 times [2025-03-16 14:03:31,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:31,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185805662] [2025-03-16 14:03:31,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:31,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:31,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 14:03:31,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 14:03:31,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:31,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:31,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:31,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185805662] [2025-03-16 14:03:31,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185805662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:31,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:31,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:03:31,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759013030] [2025-03-16 14:03:31,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:31,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:31,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:31,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:31,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:31,806 INFO L87 Difference]: Start difference. First operand has 167 states, 165 states have (on average 1.7393939393939395) internal successors, (287), 166 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:32,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:32,014 INFO L93 Difference]: Finished difference Result 362 states and 630 transitions. [2025-03-16 14:03:32,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:32,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-16 14:03:32,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:32,023 INFO L225 Difference]: With dead ends: 362 [2025-03-16 14:03:32,023 INFO L226 Difference]: Without dead ends: 188 [2025-03-16 14:03:32,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:32,028 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 55 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:32,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 329 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:03:32,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-16 14:03:32,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2025-03-16 14:03:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.6216216216216217) internal successors, (300), 185 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:32,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 300 transitions. [2025-03-16 14:03:32,065 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 300 transitions. Word has length 43 [2025-03-16 14:03:32,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:32,065 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 300 transitions. [2025-03-16 14:03:32,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:32,066 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 300 transitions. [2025-03-16 14:03:32,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 14:03:32,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:32,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:03:32,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:03:32,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:32,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:32,069 INFO L85 PathProgramCache]: Analyzing trace with hash 262079185, now seen corresponding path program 1 times [2025-03-16 14:03:32,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:32,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611311485] [2025-03-16 14:03:32,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:32,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:32,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 14:03:32,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 14:03:32,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:32,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:32,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:32,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:32,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611311485] [2025-03-16 14:03:32,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611311485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:32,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:32,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:03:32,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059137269] [2025-03-16 14:03:32,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:32,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:32,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:32,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:32,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:32,139 INFO L87 Difference]: Start difference. First operand 186 states and 300 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:32,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:32,191 INFO L93 Difference]: Finished difference Result 530 states and 857 transitions. [2025-03-16 14:03:32,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:32,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-16 14:03:32,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:32,193 INFO L225 Difference]: With dead ends: 530 [2025-03-16 14:03:32,193 INFO L226 Difference]: Without dead ends: 357 [2025-03-16 14:03:32,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:32,194 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 179 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:32,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 398 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:32,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-16 14:03:32,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-03-16 14:03:32,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 1.6123595505617978) internal successors, (574), 356 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 574 transitions. [2025-03-16 14:03:32,213 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 574 transitions. Word has length 44 [2025-03-16 14:03:32,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:32,213 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 574 transitions. [2025-03-16 14:03:32,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:32,214 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 574 transitions. [2025-03-16 14:03:32,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 14:03:32,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:32,215 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:03:32,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:03:32,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:32,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:32,216 INFO L85 PathProgramCache]: Analyzing trace with hash 492952803, now seen corresponding path program 1 times [2025-03-16 14:03:32,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:32,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532596283] [2025-03-16 14:03:32,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:32,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:32,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 14:03:32,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 14:03:32,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:32,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:32,287 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:32,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:32,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532596283] [2025-03-16 14:03:32,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532596283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:32,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:32,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:32,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336779013] [2025-03-16 14:03:32,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:32,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:32,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:32,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:32,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:32,291 INFO L87 Difference]: Start difference. First operand 357 states and 574 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:32,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:32,404 INFO L93 Difference]: Finished difference Result 741 states and 1191 transitions. [2025-03-16 14:03:32,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:32,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-16 14:03:32,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:32,406 INFO L225 Difference]: With dead ends: 741 [2025-03-16 14:03:32,406 INFO L226 Difference]: Without dead ends: 397 [2025-03-16 14:03:32,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:32,407 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 9 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:32,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 354 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:32,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-16 14:03:32,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2025-03-16 14:03:32,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.5757575757575757) internal successors, (624), 396 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:32,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 624 transitions. [2025-03-16 14:03:32,428 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 624 transitions. Word has length 59 [2025-03-16 14:03:32,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:32,428 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 624 transitions. [2025-03-16 14:03:32,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 624 transitions. [2025-03-16 14:03:32,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 14:03:32,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:32,434 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:03:32,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:03:32,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:32,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:32,434 INFO L85 PathProgramCache]: Analyzing trace with hash 139996773, now seen corresponding path program 1 times [2025-03-16 14:03:32,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:32,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809082320] [2025-03-16 14:03:32,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:32,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:32,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 14:03:32,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 14:03:32,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:32,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 14:03:32,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:32,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809082320] [2025-03-16 14:03:32,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809082320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:32,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:32,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:32,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460115770] [2025-03-16 14:03:32,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:32,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:32,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:32,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:32,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:32,489 INFO L87 Difference]: Start difference. First operand 397 states and 624 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:32,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:32,631 INFO L93 Difference]: Finished difference Result 863 states and 1371 transitions. [2025-03-16 14:03:32,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:32,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-16 14:03:32,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:32,633 INFO L225 Difference]: With dead ends: 863 [2025-03-16 14:03:32,633 INFO L226 Difference]: Without dead ends: 479 [2025-03-16 14:03:32,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:32,634 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 10 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:32,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 355 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:32,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-16 14:03:32,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2025-03-16 14:03:32,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 478 states have (on average 1.497907949790795) internal successors, (716), 478 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 716 transitions. [2025-03-16 14:03:32,644 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 716 transitions. Word has length 79 [2025-03-16 14:03:32,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:32,644 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 716 transitions. [2025-03-16 14:03:32,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:32,645 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 716 transitions. [2025-03-16 14:03:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 14:03:32,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:32,646 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:03:32,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:03:32,647 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:32,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:32,647 INFO L85 PathProgramCache]: Analyzing trace with hash 264070020, now seen corresponding path program 1 times [2025-03-16 14:03:32,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:32,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122939266] [2025-03-16 14:03:32,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:32,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:32,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 14:03:32,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 14:03:32,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:32,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 14:03:32,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:32,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122939266] [2025-03-16 14:03:32,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122939266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:32,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:32,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:32,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526469120] [2025-03-16 14:03:32,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:32,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:32,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:32,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:32,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:32,699 INFO L87 Difference]: Start difference. First operand 479 states and 716 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:32,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:32,828 INFO L93 Difference]: Finished difference Result 989 states and 1483 transitions. [2025-03-16 14:03:32,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:32,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-16 14:03:32,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:32,830 INFO L225 Difference]: With dead ends: 989 [2025-03-16 14:03:32,830 INFO L226 Difference]: Without dead ends: 523 [2025-03-16 14:03:32,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:32,831 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 9 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:32,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 355 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:32,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-16 14:03:32,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-03-16 14:03:32,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.475095785440613) internal successors, (770), 522 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 770 transitions. [2025-03-16 14:03:32,841 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 770 transitions. Word has length 79 [2025-03-16 14:03:32,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:32,841 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 770 transitions. [2025-03-16 14:03:32,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 770 transitions. [2025-03-16 14:03:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 14:03:32,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:32,842 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:03:32,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:03:32,842 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:32,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:32,842 INFO L85 PathProgramCache]: Analyzing trace with hash 481502138, now seen corresponding path program 1 times [2025-03-16 14:03:32,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:32,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798215591] [2025-03-16 14:03:32,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:32,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:32,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 14:03:32,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 14:03:32,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:32,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:32,901 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-16 14:03:32,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:32,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798215591] [2025-03-16 14:03:32,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798215591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:32,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:32,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:32,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509785143] [2025-03-16 14:03:32,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:32,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:32,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:32,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:32,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:32,903 INFO L87 Difference]: Start difference. First operand 523 states and 770 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:33,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:33,015 INFO L93 Difference]: Finished difference Result 1081 states and 1599 transitions. [2025-03-16 14:03:33,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:33,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-16 14:03:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:33,017 INFO L225 Difference]: With dead ends: 1081 [2025-03-16 14:03:33,017 INFO L226 Difference]: Without dead ends: 571 [2025-03-16 14:03:33,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:33,018 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 9 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:33,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 354 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:33,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-16 14:03:33,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2025-03-16 14:03:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 570 states have (on average 1.4526315789473685) internal successors, (828), 570 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 828 transitions. [2025-03-16 14:03:33,027 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 828 transitions. Word has length 99 [2025-03-16 14:03:33,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:33,027 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 828 transitions. [2025-03-16 14:03:33,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 828 transitions. [2025-03-16 14:03:33,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-16 14:03:33,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:33,029 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-16 14:03:33,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:03:33,029 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:33,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:33,029 INFO L85 PathProgramCache]: Analyzing trace with hash 962704224, now seen corresponding path program 1 times [2025-03-16 14:03:33,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:33,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621402548] [2025-03-16 14:03:33,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:33,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:33,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-16 14:03:33,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-16 14:03:33,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:33,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:33,101 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-16 14:03:33,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:33,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621402548] [2025-03-16 14:03:33,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621402548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:33,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:33,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:33,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775391210] [2025-03-16 14:03:33,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:33,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:33,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:33,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:33,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:33,103 INFO L87 Difference]: Start difference. First operand 571 states and 828 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:33,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:33,147 INFO L93 Difference]: Finished difference Result 1125 states and 1634 transitions. [2025-03-16 14:03:33,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:33,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2025-03-16 14:03:33,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:33,150 INFO L225 Difference]: With dead ends: 1125 [2025-03-16 14:03:33,150 INFO L226 Difference]: Without dead ends: 845 [2025-03-16 14:03:33,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:33,152 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 156 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:33,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 602 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:33,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-03-16 14:03:33,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2025-03-16 14:03:33,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.4490521327014219) internal successors, (1223), 844 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:33,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1223 transitions. [2025-03-16 14:03:33,184 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1223 transitions. Word has length 117 [2025-03-16 14:03:33,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:33,184 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1223 transitions. [2025-03-16 14:03:33,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:33,185 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1223 transitions. [2025-03-16 14:03:33,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-16 14:03:33,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:33,186 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-16 14:03:33,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:03:33,187 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:33,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:33,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1086777471, now seen corresponding path program 1 times [2025-03-16 14:03:33,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:33,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018395724] [2025-03-16 14:03:33,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:33,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:33,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-16 14:03:33,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-16 14:03:33,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:33,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 14:03:33,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:33,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018395724] [2025-03-16 14:03:33,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018395724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:33,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:33,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:33,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850839079] [2025-03-16 14:03:33,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:33,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:33,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:33,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:33,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:33,232 INFO L87 Difference]: Start difference. First operand 845 states and 1223 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:33,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:33,281 INFO L93 Difference]: Finished difference Result 1675 states and 2427 transitions. [2025-03-16 14:03:33,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:33,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2025-03-16 14:03:33,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:33,284 INFO L225 Difference]: With dead ends: 1675 [2025-03-16 14:03:33,284 INFO L226 Difference]: Without dead ends: 1121 [2025-03-16 14:03:33,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:33,286 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 158 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:33,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 604 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:33,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2025-03-16 14:03:33,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1121. [2025-03-16 14:03:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.4473214285714286) internal successors, (1621), 1120 states have internal predecessors, (1621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1621 transitions. [2025-03-16 14:03:33,302 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1621 transitions. Word has length 117 [2025-03-16 14:03:33,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:33,302 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1621 transitions. [2025-03-16 14:03:33,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1621 transitions. [2025-03-16 14:03:33,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-16 14:03:33,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:33,306 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-16 14:03:33,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:03:33,306 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:33,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:33,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1870156446, now seen corresponding path program 1 times [2025-03-16 14:03:33,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:33,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749649798] [2025-03-16 14:03:33,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:33,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:33,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-16 14:03:33,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-16 14:03:33,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:33,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 14:03:33,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:33,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749649798] [2025-03-16 14:03:33,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749649798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:33,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:33,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:33,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207137433] [2025-03-16 14:03:33,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:33,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:33,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:33,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:33,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:33,349 INFO L87 Difference]: Start difference. First operand 1121 states and 1621 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:33,384 INFO L93 Difference]: Finished difference Result 1974 states and 2849 transitions. [2025-03-16 14:03:33,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:33,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2025-03-16 14:03:33,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:33,387 INFO L225 Difference]: With dead ends: 1974 [2025-03-16 14:03:33,387 INFO L226 Difference]: Without dead ends: 1144 [2025-03-16 14:03:33,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:33,389 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 10 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:33,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 446 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2025-03-16 14:03:33,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1144. [2025-03-16 14:03:33,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 1.442694663167104) internal successors, (1649), 1143 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1649 transitions. [2025-03-16 14:03:33,407 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1649 transitions. Word has length 117 [2025-03-16 14:03:33,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:33,407 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1649 transitions. [2025-03-16 14:03:33,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:33,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1649 transitions. [2025-03-16 14:03:33,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-16 14:03:33,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:33,418 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:03:33,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:03:33,418 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:33,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:33,419 INFO L85 PathProgramCache]: Analyzing trace with hash -773816810, now seen corresponding path program 1 times [2025-03-16 14:03:33,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:33,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117368501] [2025-03-16 14:03:33,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:33,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:33,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-16 14:03:33,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-16 14:03:33,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:33,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-16 14:03:33,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:33,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117368501] [2025-03-16 14:03:33,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117368501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:33,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:33,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:33,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834810790] [2025-03-16 14:03:33,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:33,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:33,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:33,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:33,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:33,488 INFO L87 Difference]: Start difference. First operand 1144 states and 1649 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:33,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:33,622 INFO L93 Difference]: Finished difference Result 2401 states and 3502 transitions. [2025-03-16 14:03:33,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:33,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2025-03-16 14:03:33,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:33,626 INFO L225 Difference]: With dead ends: 2401 [2025-03-16 14:03:33,627 INFO L226 Difference]: Without dead ends: 1270 [2025-03-16 14:03:33,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:33,629 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 14 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:33,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 353 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:33,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2025-03-16 14:03:33,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1264. [2025-03-16 14:03:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1263 states have (on average 1.412509897070467) internal successors, (1784), 1263 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1784 transitions. [2025-03-16 14:03:33,650 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1784 transitions. Word has length 155 [2025-03-16 14:03:33,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:33,650 INFO L471 AbstractCegarLoop]: Abstraction has 1264 states and 1784 transitions. [2025-03-16 14:03:33,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:33,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1784 transitions. [2025-03-16 14:03:33,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-16 14:03:33,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:33,653 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:03:33,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:03:33,653 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:33,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:33,654 INFO L85 PathProgramCache]: Analyzing trace with hash 377382403, now seen corresponding path program 1 times [2025-03-16 14:03:33,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:33,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722568983] [2025-03-16 14:03:33,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:33,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:33,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-16 14:03:33,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-16 14:03:33,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:33,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-16 14:03:33,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:33,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722568983] [2025-03-16 14:03:33,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722568983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:33,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:33,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:33,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990926422] [2025-03-16 14:03:33,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:33,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:33,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:33,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:33,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:33,710 INFO L87 Difference]: Start difference. First operand 1264 states and 1784 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:33,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:33,839 INFO L93 Difference]: Finished difference Result 2635 states and 3755 transitions. [2025-03-16 14:03:33,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:33,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 196 [2025-03-16 14:03:33,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:33,845 INFO L225 Difference]: With dead ends: 2635 [2025-03-16 14:03:33,845 INFO L226 Difference]: Without dead ends: 1384 [2025-03-16 14:03:33,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:33,847 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 10 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:33,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 339 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:33,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-03-16 14:03:33,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2025-03-16 14:03:33,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 1.39117859725235) internal successors, (1924), 1383 states have internal predecessors, (1924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:33,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1924 transitions. [2025-03-16 14:03:33,872 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1924 transitions. Word has length 196 [2025-03-16 14:03:33,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:33,872 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1924 transitions. [2025-03-16 14:03:33,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:33,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1924 transitions. [2025-03-16 14:03:33,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-16 14:03:33,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:33,877 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:03:33,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:03:33,877 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:33,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:33,877 INFO L85 PathProgramCache]: Analyzing trace with hash 606930269, now seen corresponding path program 1 times [2025-03-16 14:03:33,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:33,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223057422] [2025-03-16 14:03:33,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:33,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:33,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-16 14:03:33,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-16 14:03:33,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:33,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:33,983 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2025-03-16 14:03:33,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:33,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223057422] [2025-03-16 14:03:33,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223057422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:33,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:33,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:33,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133439678] [2025-03-16 14:03:33,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:33,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:33,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:33,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:33,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:33,985 INFO L87 Difference]: Start difference. First operand 1384 states and 1924 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:34,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:34,113 INFO L93 Difference]: Finished difference Result 2923 states and 4123 transitions. [2025-03-16 14:03:34,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:34,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 223 [2025-03-16 14:03:34,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:34,117 INFO L225 Difference]: With dead ends: 2923 [2025-03-16 14:03:34,117 INFO L226 Difference]: Without dead ends: 1377 [2025-03-16 14:03:34,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:34,119 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 9 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:34,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 354 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:34,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-03-16 14:03:34,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1377. [2025-03-16 14:03:34,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1376 states have (on average 1.385174418604651) internal successors, (1906), 1376 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:34,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1906 transitions. [2025-03-16 14:03:34,139 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1906 transitions. Word has length 223 [2025-03-16 14:03:34,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:34,139 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1906 transitions. [2025-03-16 14:03:34,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1906 transitions. [2025-03-16 14:03:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-16 14:03:34,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:34,142 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:03:34,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:03:34,142 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:34,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:34,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1127099222, now seen corresponding path program 1 times [2025-03-16 14:03:34,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:34,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590338527] [2025-03-16 14:03:34,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:34,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:34,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-16 14:03:34,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-16 14:03:34,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:34,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2025-03-16 14:03:34,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:34,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590338527] [2025-03-16 14:03:34,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590338527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:34,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:34,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:34,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574382934] [2025-03-16 14:03:34,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:34,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:34,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:34,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:34,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:34,222 INFO L87 Difference]: Start difference. First operand 1377 states and 1906 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:34,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:34,271 INFO L93 Difference]: Finished difference Result 3967 states and 5513 transitions. [2025-03-16 14:03:34,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:34,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261 [2025-03-16 14:03:34,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:34,276 INFO L225 Difference]: With dead ends: 3967 [2025-03-16 14:03:34,276 INFO L226 Difference]: Without dead ends: 1654 [2025-03-16 14:03:34,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:34,279 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 143 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 604 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.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:34,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 604 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2025-03-16 14:03:34,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1652. [2025-03-16 14:03:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 1651 states have (on average 1.3864324651726228) internal successors, (2289), 1651 states have internal predecessors, (2289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2289 transitions. [2025-03-16 14:03:34,305 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2289 transitions. Word has length 261 [2025-03-16 14:03:34,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:34,305 INFO L471 AbstractCegarLoop]: Abstraction has 1652 states and 2289 transitions. [2025-03-16 14:03:34,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:34,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2289 transitions. [2025-03-16 14:03:34,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-16 14:03:34,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:34,308 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:03:34,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:03:34,309 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:34,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:34,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2646222, now seen corresponding path program 1 times [2025-03-16 14:03:34,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:34,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69750571] [2025-03-16 14:03:34,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:34,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:34,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-16 14:03:34,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-16 14:03:34,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:34,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2025-03-16 14:03:34,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:34,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69750571] [2025-03-16 14:03:34,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69750571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:34,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:34,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:34,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942988291] [2025-03-16 14:03:34,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:34,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:34,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:34,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:34,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:34,404 INFO L87 Difference]: Start difference. First operand 1652 states and 2289 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:34,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:34,531 INFO L93 Difference]: Finished difference Result 3421 states and 4772 transitions. [2025-03-16 14:03:34,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:34,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 307 [2025-03-16 14:03:34,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:34,536 INFO L225 Difference]: With dead ends: 3421 [2025-03-16 14:03:34,536 INFO L226 Difference]: Without dead ends: 1782 [2025-03-16 14:03:34,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:34,538 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 9 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:34,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 351 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:34,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2025-03-16 14:03:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1782. [2025-03-16 14:03:34,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1781 states have (on average 1.3722627737226278) internal successors, (2444), 1781 states have internal predecessors, (2444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2444 transitions. [2025-03-16 14:03:34,570 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2444 transitions. Word has length 307 [2025-03-16 14:03:34,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:34,570 INFO L471 AbstractCegarLoop]: Abstraction has 1782 states and 2444 transitions. [2025-03-16 14:03:34,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:34,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2444 transitions. [2025-03-16 14:03:34,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-16 14:03:34,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:34,573 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:03:34,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:03:34,573 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:34,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:34,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1332270872, now seen corresponding path program 1 times [2025-03-16 14:03:34,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:34,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080379987] [2025-03-16 14:03:34,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:34,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:34,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-16 14:03:34,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-16 14:03:34,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:34,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 607 proven. 0 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2025-03-16 14:03:34,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:34,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080379987] [2025-03-16 14:03:34,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080379987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:34,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:34,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:34,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611645510] [2025-03-16 14:03:34,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:34,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:34,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:34,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:34,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:34,665 INFO L87 Difference]: Start difference. First operand 1782 states and 2444 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:34,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:34,781 INFO L93 Difference]: Finished difference Result 3691 states and 5102 transitions. [2025-03-16 14:03:34,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:34,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 329 [2025-03-16 14:03:34,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:34,786 INFO L225 Difference]: With dead ends: 3691 [2025-03-16 14:03:34,786 INFO L226 Difference]: Without dead ends: 1922 [2025-03-16 14:03:34,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:34,789 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 9 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:34,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 351 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:34,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2025-03-16 14:03:34,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1922. [2025-03-16 14:03:34,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1921 states have (on average 1.3581467985424258) internal successors, (2609), 1921 states have internal predecessors, (2609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2609 transitions. [2025-03-16 14:03:34,830 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2609 transitions. Word has length 329 [2025-03-16 14:03:34,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:34,830 INFO L471 AbstractCegarLoop]: Abstraction has 1922 states and 2609 transitions. [2025-03-16 14:03:34,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:34,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2609 transitions. [2025-03-16 14:03:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-16 14:03:34,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:34,834 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:03:34,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:03:34,834 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:34,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:34,834 INFO L85 PathProgramCache]: Analyzing trace with hash -453580313, now seen corresponding path program 1 times [2025-03-16 14:03:34,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:34,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045525980] [2025-03-16 14:03:34,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:34,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:34,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-16 14:03:34,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-16 14:03:34,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:34,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 860 proven. 25 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-03-16 14:03:34,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:34,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045525980] [2025-03-16 14:03:34,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045525980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:03:34,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675739685] [2025-03-16 14:03:34,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:34,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:34,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:34,988 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-16 14:03:34,989 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-16 14:03:35,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-16 14:03:35,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-16 14:03:35,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:35,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:35,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:03:35,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 860 proven. 25 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-03-16 14:03:35,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:35,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 860 proven. 25 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-03-16 14:03:35,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675739685] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:35,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:03:35,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 14:03:35,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342091789] [2025-03-16 14:03:35,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:35,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 14:03:35,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:35,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 14:03:35,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:03:35,330 INFO L87 Difference]: Start difference. First operand 1922 states and 2609 transitions. Second operand has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:35,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:35,836 INFO L93 Difference]: Finished difference Result 6432 states and 8920 transitions. [2025-03-16 14:03:35,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 14:03:35,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 361 [2025-03-16 14:03:35,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:35,848 INFO L225 Difference]: With dead ends: 6432 [2025-03-16 14:03:35,848 INFO L226 Difference]: Without dead ends: 4297 [2025-03-16 14:03:35,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 724 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-16 14:03:35,851 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 716 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:35,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 968 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:03:35,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4297 states. [2025-03-16 14:03:35,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4297 to 2534. [2025-03-16 14:03:35,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2534 states, 2533 states have (on average 1.4228187919463087) internal successors, (3604), 2533 states have internal predecessors, (3604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3604 transitions. [2025-03-16 14:03:35,905 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3604 transitions. Word has length 361 [2025-03-16 14:03:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:35,906 INFO L471 AbstractCegarLoop]: Abstraction has 2534 states and 3604 transitions. [2025-03-16 14:03:35,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:35,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3604 transitions. [2025-03-16 14:03:35,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-16 14:03:35,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:35,910 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:03:35,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 14:03:36,115 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,SelfDestructingSolverStorable15 [2025-03-16 14:03:36,115 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:36,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:36,115 INFO L85 PathProgramCache]: Analyzing trace with hash 429550597, now seen corresponding path program 1 times [2025-03-16 14:03:36,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:36,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516888737] [2025-03-16 14:03:36,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:36,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:36,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-16 14:03:36,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-16 14:03:36,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:36,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 1260 proven. 0 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2025-03-16 14:03:36,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:36,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516888737] [2025-03-16 14:03:36,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516888737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:36,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:36,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:36,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131753519] [2025-03-16 14:03:36,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:36,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:36,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:36,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:36,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:36,304 INFO L87 Difference]: Start difference. First operand 2534 states and 3604 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:36,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:36,441 INFO L93 Difference]: Finished difference Result 5418 states and 7814 transitions. [2025-03-16 14:03:36,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:36,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 458 [2025-03-16 14:03:36,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:36,450 INFO L225 Difference]: With dead ends: 5418 [2025-03-16 14:03:36,450 INFO L226 Difference]: Without dead ends: 2897 [2025-03-16 14:03:36,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:36,453 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 9 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:36,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 351 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:36,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2025-03-16 14:03:36,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 2897. [2025-03-16 14:03:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2897 states, 2896 states have (on average 1.3888121546961325) internal successors, (4022), 2896 states have internal predecessors, (4022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 4022 transitions. [2025-03-16 14:03:36,502 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 4022 transitions. Word has length 458 [2025-03-16 14:03:36,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:36,503 INFO L471 AbstractCegarLoop]: Abstraction has 2897 states and 4022 transitions. [2025-03-16 14:03:36,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:36,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 4022 transitions. [2025-03-16 14:03:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-16 14:03:36,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:36,509 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:03:36,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 14:03:36,509 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:36,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:36,510 INFO L85 PathProgramCache]: Analyzing trace with hash 189354773, now seen corresponding path program 1 times [2025-03-16 14:03:36,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:36,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082031148] [2025-03-16 14:03:36,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:36,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:36,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-16 14:03:36,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-16 14:03:36,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:36,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:36,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2967 backedges. 1680 proven. 0 refuted. 0 times theorem prover too weak. 1287 trivial. 0 not checked. [2025-03-16 14:03:36,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:36,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082031148] [2025-03-16 14:03:36,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082031148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:36,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:36,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:36,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542475783] [2025-03-16 14:03:36,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:36,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:36,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:36,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:36,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:36,633 INFO L87 Difference]: Start difference. First operand 2897 states and 4022 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:36,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:36,767 INFO L93 Difference]: Finished difference Result 5990 states and 8387 transitions. [2025-03-16 14:03:36,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:36,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 518 [2025-03-16 14:03:36,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:36,775 INFO L225 Difference]: With dead ends: 5990 [2025-03-16 14:03:36,775 INFO L226 Difference]: Without dead ends: 3106 [2025-03-16 14:03:36,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:36,778 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 9 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:36,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 351 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:36,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2025-03-16 14:03:36,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 2684. [2025-03-16 14:03:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2684 states, 2683 states have (on average 1.3704808050689528) internal successors, (3677), 2683 states have internal predecessors, (3677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 3677 transitions. [2025-03-16 14:03:36,818 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 3677 transitions. Word has length 518 [2025-03-16 14:03:36,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:36,818 INFO L471 AbstractCegarLoop]: Abstraction has 2684 states and 3677 transitions. [2025-03-16 14:03:36,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:36,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 3677 transitions. [2025-03-16 14:03:36,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-03-16 14:03:36,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:36,821 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 11, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:03:36,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 14:03:36,822 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:36,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:36,822 INFO L85 PathProgramCache]: Analyzing trace with hash -631951093, now seen corresponding path program 1 times [2025-03-16 14:03:36,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:36,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880078854] [2025-03-16 14:03:36,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:36,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:36,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-16 14:03:36,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-16 14:03:36,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:36,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:36,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3785 backedges. 2121 proven. 0 refuted. 0 times theorem prover too weak. 1664 trivial. 0 not checked. [2025-03-16 14:03:36,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:36,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880078854] [2025-03-16 14:03:36,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880078854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:36,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:36,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:36,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640092067] [2025-03-16 14:03:36,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:36,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:36,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:36,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:36,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:36,969 INFO L87 Difference]: Start difference. First operand 2684 states and 3677 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:37,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:37,113 INFO L93 Difference]: Finished difference Result 5045 states and 6812 transitions. [2025-03-16 14:03:37,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:37,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 572 [2025-03-16 14:03:37,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:37,119 INFO L225 Difference]: With dead ends: 5045 [2025-03-16 14:03:37,120 INFO L226 Difference]: Without dead ends: 2261 [2025-03-16 14:03:37,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:37,124 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 27 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:37,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 347 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:37,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2025-03-16 14:03:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2257. [2025-03-16 14:03:37,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.2890070921985815) internal successors, (2908), 2256 states have internal predecessors, (2908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 2908 transitions. [2025-03-16 14:03:37,164 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 2908 transitions. Word has length 572 [2025-03-16 14:03:37,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:37,165 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 2908 transitions. [2025-03-16 14:03:37,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:37,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 2908 transitions. [2025-03-16 14:03:37,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2025-03-16 14:03:37,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:37,168 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:03:37,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 14:03:37,169 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:37,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:37,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1434200855, now seen corresponding path program 1 times [2025-03-16 14:03:37,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:37,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571818331] [2025-03-16 14:03:37,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:37,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:37,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 582 statements into 1 equivalence classes. [2025-03-16 14:03:37,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-03-16 14:03:37,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:37,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3839 backedges. 2222 proven. 25 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2025-03-16 14:03:37,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:37,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571818331] [2025-03-16 14:03:37,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571818331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:03:37,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883072041] [2025-03-16 14:03:37,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:37,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:37,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:37,384 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-16 14:03:37,385 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-16 14:03:37,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 582 statements into 1 equivalence classes. [2025-03-16 14:03:37,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-03-16 14:03:37,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:37,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:37,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:03:37,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:37,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3839 backedges. 2222 proven. 25 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2025-03-16 14:03:37,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3839 backedges. 2222 proven. 25 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2025-03-16 14:03:37,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883072041] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:37,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:03:37,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-16 14:03:37,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233873978] [2025-03-16 14:03:37,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:37,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 14:03:37,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:37,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 14:03:37,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:03:37,767 INFO L87 Difference]: Start difference. First operand 2257 states and 2908 transitions. Second operand has 8 states, 8 states have (on average 40.75) internal successors, (326), 8 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:38,170 INFO L93 Difference]: Finished difference Result 3970 states and 5175 transitions. [2025-03-16 14:03:38,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 14:03:38,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.75) internal successors, (326), 8 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 582 [2025-03-16 14:03:38,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:38,172 INFO L225 Difference]: With dead ends: 3970 [2025-03-16 14:03:38,172 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:03:38,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1172 GetRequests, 1163 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 14:03:38,175 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 185 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:38,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1074 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:03:38,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:03:38,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:03:38,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:03:38,176 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 582 [2025-03-16 14:03:38,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:38,176 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:03:38,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.75) internal successors, (326), 8 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:38,176 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:03:38,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:03:38,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:03:38,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:03:38,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-16 14:03:38,381 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:38,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:03:38,918 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:03:38,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:03:38 BoogieIcfgContainer [2025-03-16 14:03:38,931 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:03:38,934 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:03:38,934 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:03:38,934 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:03:38,935 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:03:31" (3/4) ... [2025-03-16 14:03:38,936 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:03:38,951 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-16 14:03:38,951 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:03:38,952 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:03:38,952 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:03:39,044 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:03:39,044 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:03:39,044 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:03:39,045 INFO L158 Benchmark]: Toolchain (without parser) took 8602.59ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 111.1MB in the beginning and 114.8MB in the end (delta: -3.6MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB. [2025-03-16 14:03:39,045 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:03:39,045 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.73ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 95.3MB in the end (delta: 15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:03:39,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.83ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 92.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:03:39,046 INFO L158 Benchmark]: Boogie Preprocessor took 37.41ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 90.3MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:03:39,048 INFO L158 Benchmark]: IcfgBuilder took 661.31ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 45.5MB in the end (delta: 44.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 14:03:39,048 INFO L158 Benchmark]: TraceAbstraction took 7538.18ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 45.0MB in the beginning and 126.1MB in the end (delta: -81.1MB). Peak memory consumption was 105.9MB. Max. memory is 16.1GB. [2025-03-16 14:03:39,048 INFO L158 Benchmark]: Witness Printer took 110.05ms. Allocated memory is still 268.4MB. Free memory was 126.1MB in the beginning and 114.8MB in the end (delta: 11.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:03:39,049 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.73ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 95.3MB in the end (delta: 15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.83ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 92.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.41ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 90.3MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 661.31ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 45.5MB in the end (delta: 44.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7538.18ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 45.0MB in the beginning and 126.1MB in the end (delta: -81.1MB). Peak memory consumption was 105.9MB. Max. memory is 16.1GB. * Witness Printer took 110.05ms. Allocated memory is still 268.4MB. Free memory was 126.1MB in the beginning and 114.8MB in the end (delta: 11.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 678]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 167 locations, 287 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 20, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1735 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1735 mSDsluCounter, 9240 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4158 mSDsCounter, 343 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3350 IncrementalHoareTripleChecker+Invalid, 3693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 343 mSolverCounterUnsat, 5082 mSDtfsCounter, 3350 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1956 GetRequests, 1921 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2897occurred in iteration=17, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 2199 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 5659 NumberOfCodeBlocks, 5659 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 6578 ConstructedInterpolants, 0 QuantifiedInterpolants, 8721 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1481 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 28344/28494 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 109]: Location Invariant Derived location invariant: (((((((((((((((((((((8672 <= s__state) && (3 == blastFlag)) || ((s__state == 8656) && (2 == blastFlag))) || ((2 == blastFlag) && (8560 == s__state))) || ((2 == blastFlag) && (s__state == 8512))) || ((2 == blastFlag) && (s__state == 8608))) || ((2 == blastFlag) && (0 != s__hit))) || ((2 == blastFlag) && (s__state == 8592))) || ((2 == blastFlag) && (8544 == s__state))) || (((8640 <= s__state) && (s__state <= 8655)) && (0 != s__hit))) || ((8496 == s__state) && (2 == blastFlag))) || (((2 == blastFlag) && (8640 <= s__state)) && (s__state <= 8655))) || (((3 == blastFlag) && (3 == s__s3__tmp__next_state___0)) && (8448 == s__state))) || ((3 == blastFlag) && (0 != s__hit))) || ((s__state == 8592) && (0 != s__hit))) || (((2 == blastFlag) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8576))) || ((s__state == 8608) && (0 != s__hit))) || (blastFlag < 1)) || (s__state == 3)) || ((8496 == s__state) && (blastFlag == 1))) || ((s__state == 8528) && (2 == blastFlag))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:03:39,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE