./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.loyd.1.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.loyd.1.prop1-func-interl.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 64bit --witnessprinter.graph.data.programhash aba1221204f0dfab6bbe54d8861cf1fb88f9109d65404caf61ae5236ccf822b6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 19:27:58,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 19:27:58,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 19:27:58,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 19:27:58,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 19:27:58,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 19:27:58,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 19:27:58,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 19:27:58,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 19:27:58,083 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 19:27:58,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 19:27:58,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 19:27:58,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 19:27:58,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 19:27:58,083 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 19:27:58,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 19:27:58,083 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 19:27:58,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 19:27:58,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 19:27:58,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 19:27:58,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 19:27:58,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 19:27:58,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 19:27:58,084 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 19:27:58,084 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 19:27:58,084 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 19:27:58,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 19:27:58,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 19:27:58,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 19:27:58,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:27:58,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 19:27:58,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 19:27:58,085 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 19:27:58,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 19:27:58,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 19:27:58,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 19:27:58,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 19:27:58,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 19:27:58,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 19:27:58,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 19:27:58,085 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-jdk21/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aba1221204f0dfab6bbe54d8861cf1fb88f9109d65404caf61ae5236ccf822b6 [2025-02-05 19:27:58,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 19:27:58,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 19:27:58,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 19:27:58,315 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 19:27:58,315 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 19:27:58,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.loyd.1.prop1-func-interl.c [2025-02-05 19:27:59,440 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0ae174d8/984eecec79d54c39a7d94f5fdf7cfe31/FLAG31e3611cd [2025-02-05 19:27:59,736 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 19:27:59,737 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.loyd.1.prop1-func-interl.c [2025-02-05 19:27:59,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0ae174d8/984eecec79d54c39a7d94f5fdf7cfe31/FLAG31e3611cd [2025-02-05 19:28:00,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0ae174d8/984eecec79d54c39a7d94f5fdf7cfe31 [2025-02-05 19:28:00,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 19:28:00,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 19:28:00,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 19:28:00,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 19:28:00,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 19:28:00,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:28:00" (1/1) ... [2025-02-05 19:28:00,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60592373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:28:00, skipping insertion in model container [2025-02-05 19:28:00,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:28:00" (1/1) ... [2025-02-05 19:28:00,050 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 19:28:00,165 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.loyd.1.prop1-func-interl.c[1171,1184] [2025-02-05 19:28:00,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:28:00,389 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 19:28:00,404 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.loyd.1.prop1-func-interl.c[1171,1184] [2025-02-05 19:28:00,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:28:00,500 INFO L204 MainTranslator]: Completed translation [2025-02-05 19:28:00,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:28:00 WrapperNode [2025-02-05 19:28:00,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 19:28:00,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 19:28:00,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 19:28:00,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 19:28:00,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:28:00" (1/1) ... [2025-02-05 19:28:00,540 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:28:00" (1/1) ... [2025-02-05 19:28:00,738 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2520 [2025-02-05 19:28:00,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 19:28:00,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 19:28:00,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 19:28:00,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 19:28:00,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:28:00" (1/1) ... [2025-02-05 19:28:00,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:28:00" (1/1) ... [2025-02-05 19:28:00,797 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:28:00" (1/1) ... [2025-02-05 19:28:00,924 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-02-05 19:28:00,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:28:00" (1/1) ... [2025-02-05 19:28:00,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:28:00" (1/1) ... [2025-02-05 19:28:00,977 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:28:00" (1/1) ... [2025-02-05 19:28:00,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:28:00" (1/1) ... [2025-02-05 19:28:01,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:28:00" (1/1) ... [2025-02-05 19:28:01,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:28:00" (1/1) ... [2025-02-05 19:28:01,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 19:28:01,071 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 19:28:01,071 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 19:28:01,071 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 19:28:01,073 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:28:00" (1/1) ... [2025-02-05 19:28:01,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:28:01,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:28:01,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 19:28:01,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 19:28:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 19:28:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 19:28:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 19:28:01,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 19:28:01,393 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 19:28:01,394 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 19:28:03,413 INFO L? ?]: Removed 1519 outVars from TransFormulas that were not future-live. [2025-02-05 19:28:03,414 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 19:28:03,491 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 19:28:03,491 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 19:28:03,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:28:03 BoogieIcfgContainer [2025-02-05 19:28:03,492 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 19:28:03,493 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 19:28:03,493 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 19:28:03,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 19:28:03,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 07:28:00" (1/3) ... [2025-02-05 19:28:03,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b180663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:28:03, skipping insertion in model container [2025-02-05 19:28:03,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:28:00" (2/3) ... [2025-02-05 19:28:03,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b180663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:28:03, skipping insertion in model container [2025-02-05 19:28:03,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:28:03" (3/3) ... [2025-02-05 19:28:03,498 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.loyd.1.prop1-func-interl.c [2025-02-05 19:28:03,509 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 19:28:03,510 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.loyd.1.prop1-func-interl.c that has 1 procedures, 776 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 19:28:03,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 19:28:03,568 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;@4fec77dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 19:28:03,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 19:28:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 776 states, 774 states have (on average 1.5051679586563307) internal successors, (1165), 775 states have internal predecessors, (1165), 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-02-05 19:28:03,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 19:28:03,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:03,579 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-02-05 19:28:03,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:03,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:03,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1855522519, now seen corresponding path program 1 times [2025-02-05 19:28:03,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:03,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017382022] [2025-02-05 19:28:03,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:03,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:03,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 19:28:03,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 19:28:03,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:03,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:04,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:04,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017382022] [2025-02-05 19:28:04,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017382022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:04,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:04,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:28:04,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252980294] [2025-02-05 19:28:04,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:04,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:28:04,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:04,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:28:04,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:28:04,127 INFO L87 Difference]: Start difference. First operand has 776 states, 774 states have (on average 1.5051679586563307) internal successors, (1165), 775 states have internal predecessors, (1165), 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 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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-02-05 19:28:04,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:04,623 INFO L93 Difference]: Finished difference Result 1501 states and 2257 transitions. [2025-02-05 19:28:04,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:28:04,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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-02-05 19:28:04,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:04,637 INFO L225 Difference]: With dead ends: 1501 [2025-02-05 19:28:04,638 INFO L226 Difference]: Without dead ends: 775 [2025-02-05 19:28:04,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:28:04,649 INFO L435 NwaCegarLoop]: 970 mSDtfsCounter, 0 mSDsluCounter, 1935 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2905 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:04,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2905 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 19:28:04,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-02-05 19:28:04,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2025-02-05 19:28:04,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 774 states have (on average 1.5025839793281655) internal successors, (1163), 774 states have internal predecessors, (1163), 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-02-05 19:28:04,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1163 transitions. [2025-02-05 19:28:04,717 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1163 transitions. Word has length 43 [2025-02-05 19:28:04,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:04,717 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1163 transitions. [2025-02-05 19:28:04,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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-02-05 19:28:04,718 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1163 transitions. [2025-02-05 19:28:04,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 19:28:04,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:04,718 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-02-05 19:28:04,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 19:28:04,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:04,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:04,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1691303596, now seen corresponding path program 1 times [2025-02-05 19:28:04,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:04,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92736469] [2025-02-05 19:28:04,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:04,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:04,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 19:28:04,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 19:28:04,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:04,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:04,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:04,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:04,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92736469] [2025-02-05 19:28:04,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92736469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:04,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:04,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:28:04,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727262938] [2025-02-05 19:28:04,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:04,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:28:04,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:04,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:28:04,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:28:04,863 INFO L87 Difference]: Start difference. First operand 775 states and 1163 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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-02-05 19:28:05,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:05,171 INFO L93 Difference]: Finished difference Result 1502 states and 2255 transitions. [2025-02-05 19:28:05,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:28:05,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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-02-05 19:28:05,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:05,175 INFO L225 Difference]: With dead ends: 1502 [2025-02-05 19:28:05,175 INFO L226 Difference]: Without dead ends: 777 [2025-02-05 19:28:05,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:28:05,176 INFO L435 NwaCegarLoop]: 970 mSDtfsCounter, 0 mSDsluCounter, 1932 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2902 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:05,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2902 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 19:28:05,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2025-02-05 19:28:05,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 777. [2025-02-05 19:28:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 776 states have (on average 1.5012886597938144) internal successors, (1165), 776 states have internal predecessors, (1165), 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-02-05 19:28:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1165 transitions. [2025-02-05 19:28:05,190 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1165 transitions. Word has length 44 [2025-02-05 19:28:05,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:05,190 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 1165 transitions. [2025-02-05 19:28:05,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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-02-05 19:28:05,190 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1165 transitions. [2025-02-05 19:28:05,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 19:28:05,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:05,194 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, 1] [2025-02-05 19:28:05,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 19:28:05,195 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:05,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:05,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1472652942, now seen corresponding path program 1 times [2025-02-05 19:28:05,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:05,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44678478] [2025-02-05 19:28:05,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:05,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:05,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 19:28:05,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 19:28:05,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:05,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:05,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:05,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44678478] [2025-02-05 19:28:05,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44678478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:05,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:05,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:28:05,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359183067] [2025-02-05 19:28:05,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:05,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:28:05,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:05,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:28:05,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:28:05,357 INFO L87 Difference]: Start difference. First operand 777 states and 1165 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-02-05 19:28:05,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:05,839 INFO L93 Difference]: Finished difference Result 2169 states and 3256 transitions. [2025-02-05 19:28:05,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:28:05,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 45 [2025-02-05 19:28:05,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:05,844 INFO L225 Difference]: With dead ends: 2169 [2025-02-05 19:28:05,845 INFO L226 Difference]: Without dead ends: 1442 [2025-02-05 19:28:05,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:05,847 INFO L435 NwaCegarLoop]: 966 mSDtfsCounter, 1042 mSDsluCounter, 2832 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 3798 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:05,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 3798 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 19:28:05,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2025-02-05 19:28:05,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 799. [2025-02-05 19:28:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.5) internal successors, (1197), 798 states have internal predecessors, (1197), 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-02-05 19:28:05,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1197 transitions. [2025-02-05 19:28:05,864 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1197 transitions. Word has length 45 [2025-02-05 19:28:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:05,864 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1197 transitions. [2025-02-05 19:28:05,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-02-05 19:28:05,864 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1197 transitions. [2025-02-05 19:28:05,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-02-05 19:28:05,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:05,876 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:05,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 19:28:05,876 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:05,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:05,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1849319780, now seen corresponding path program 1 times [2025-02-05 19:28:05,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:05,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211869950] [2025-02-05 19:28:05,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:05,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:06,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-02-05 19:28:06,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-02-05 19:28:06,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:06,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:07,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:07,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211869950] [2025-02-05 19:28:07,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211869950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:07,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:07,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:28:07,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659395537] [2025-02-05 19:28:07,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:07,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:28:07,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:07,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:28:07,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:28:07,152 INFO L87 Difference]: Start difference. First operand 799 states and 1197 transitions. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 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-02-05 19:28:07,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:07,417 INFO L93 Difference]: Finished difference Result 1526 states and 2288 transitions. [2025-02-05 19:28:07,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:28:07,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 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 402 [2025-02-05 19:28:07,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:07,420 INFO L225 Difference]: With dead ends: 1526 [2025-02-05 19:28:07,422 INFO L226 Difference]: Without dead ends: 799 [2025-02-05 19:28:07,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:28:07,424 INFO L435 NwaCegarLoop]: 964 mSDtfsCounter, 1103 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:07,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 1926 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:28:07,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-02-05 19:28:07,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2025-02-05 19:28:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.4987468671679198) internal successors, (1196), 798 states have internal predecessors, (1196), 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-02-05 19:28:07,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1196 transitions. [2025-02-05 19:28:07,436 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1196 transitions. Word has length 402 [2025-02-05 19:28:07,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:07,437 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1196 transitions. [2025-02-05 19:28:07,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 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-02-05 19:28:07,438 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1196 transitions. [2025-02-05 19:28:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-02-05 19:28:07,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:07,442 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:07,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 19:28:07,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:07,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:07,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1783289034, now seen corresponding path program 1 times [2025-02-05 19:28:07,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:07,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585171807] [2025-02-05 19:28:07,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:07,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:07,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-05 19:28:07,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-05 19:28:07,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:07,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:08,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:08,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585171807] [2025-02-05 19:28:08,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585171807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:08,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:08,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:28:08,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135640442] [2025-02-05 19:28:08,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:08,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:28:08,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:08,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:28:08,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:28:08,433 INFO L87 Difference]: Start difference. First operand 799 states and 1196 transitions. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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-02-05 19:28:08,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:08,678 INFO L93 Difference]: Finished difference Result 1526 states and 2286 transitions. [2025-02-05 19:28:08,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:28:08,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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 403 [2025-02-05 19:28:08,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:08,681 INFO L225 Difference]: With dead ends: 1526 [2025-02-05 19:28:08,682 INFO L226 Difference]: Without dead ends: 799 [2025-02-05 19:28:08,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:28:08,683 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 1097 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:08,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 1924 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:28:08,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-02-05 19:28:08,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2025-02-05 19:28:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.4974937343358397) internal successors, (1195), 798 states have internal predecessors, (1195), 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-02-05 19:28:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1195 transitions. [2025-02-05 19:28:08,693 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1195 transitions. Word has length 403 [2025-02-05 19:28:08,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:08,694 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1195 transitions. [2025-02-05 19:28:08,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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-02-05 19:28:08,694 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1195 transitions. [2025-02-05 19:28:08,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-02-05 19:28:08,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:08,701 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:08,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 19:28:08,701 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:08,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:08,702 INFO L85 PathProgramCache]: Analyzing trace with hash 366731368, now seen corresponding path program 1 times [2025-02-05 19:28:08,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:08,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005698448] [2025-02-05 19:28:08,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:08,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:08,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-02-05 19:28:08,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-02-05 19:28:08,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:08,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:09,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:09,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005698448] [2025-02-05 19:28:09,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005698448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:09,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:09,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:28:09,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504924382] [2025-02-05 19:28:09,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:09,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:28:09,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:09,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:28:09,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:28:09,496 INFO L87 Difference]: Start difference. First operand 799 states and 1195 transitions. Second operand has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 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-02-05 19:28:09,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:09,857 INFO L93 Difference]: Finished difference Result 1526 states and 2284 transitions. [2025-02-05 19:28:09,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:28:09,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 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 404 [2025-02-05 19:28:09,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:09,861 INFO L225 Difference]: With dead ends: 1526 [2025-02-05 19:28:09,861 INFO L226 Difference]: Without dead ends: 799 [2025-02-05 19:28:09,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:28:09,862 INFO L435 NwaCegarLoop]: 962 mSDtfsCounter, 1091 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:09,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 1922 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 19:28:09,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-02-05 19:28:09,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2025-02-05 19:28:09,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.4962406015037595) internal successors, (1194), 798 states have internal predecessors, (1194), 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-02-05 19:28:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1194 transitions. [2025-02-05 19:28:09,874 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1194 transitions. Word has length 404 [2025-02-05 19:28:09,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:09,874 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1194 transitions. [2025-02-05 19:28:09,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 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-02-05 19:28:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1194 transitions. [2025-02-05 19:28:09,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-02-05 19:28:09,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:09,878 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:09,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 19:28:09,878 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:09,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:09,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1376101890, now seen corresponding path program 1 times [2025-02-05 19:28:09,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:09,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924844017] [2025-02-05 19:28:09,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:09,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:09,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-02-05 19:28:10,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-02-05 19:28:10,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:10,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:10,427 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:10,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:10,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924844017] [2025-02-05 19:28:10,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924844017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:10,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:10,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:28:10,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722938632] [2025-02-05 19:28:10,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:10,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:28:10,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:10,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:28:10,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:28:10,428 INFO L87 Difference]: Start difference. First operand 799 states and 1194 transitions. Second operand has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 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-02-05 19:28:10,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:10,691 INFO L93 Difference]: Finished difference Result 1526 states and 2282 transitions. [2025-02-05 19:28:10,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:28:10,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 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 405 [2025-02-05 19:28:10,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:10,694 INFO L225 Difference]: With dead ends: 1526 [2025-02-05 19:28:10,694 INFO L226 Difference]: Without dead ends: 799 [2025-02-05 19:28:10,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:28:10,697 INFO L435 NwaCegarLoop]: 961 mSDtfsCounter, 1085 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 1920 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:10,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 1920 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:28:10,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-02-05 19:28:10,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2025-02-05 19:28:10,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.494987468671679) internal successors, (1193), 798 states have internal predecessors, (1193), 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-02-05 19:28:10,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1193 transitions. [2025-02-05 19:28:10,735 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1193 transitions. Word has length 405 [2025-02-05 19:28:10,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:10,735 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1193 transitions. [2025-02-05 19:28:10,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 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-02-05 19:28:10,736 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1193 transitions. [2025-02-05 19:28:10,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-02-05 19:28:10,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:10,740 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:10,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 19:28:10,740 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:10,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:10,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1738109388, now seen corresponding path program 1 times [2025-02-05 19:28:10,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:10,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26667640] [2025-02-05 19:28:10,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:10,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:10,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-05 19:28:10,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-05 19:28:10,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:10,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:11,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:11,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26667640] [2025-02-05 19:28:11,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26667640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:11,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:11,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:28:11,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525350337] [2025-02-05 19:28:11,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:11,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:28:11,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:11,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:28:11,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:28:11,366 INFO L87 Difference]: Start difference. First operand 799 states and 1193 transitions. Second operand has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 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-02-05 19:28:11,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:11,741 INFO L93 Difference]: Finished difference Result 1526 states and 2280 transitions. [2025-02-05 19:28:11,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:28:11,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 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 406 [2025-02-05 19:28:11,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:11,743 INFO L225 Difference]: With dead ends: 1526 [2025-02-05 19:28:11,743 INFO L226 Difference]: Without dead ends: 799 [2025-02-05 19:28:11,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:28:11,745 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 1079 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:11,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 1918 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 19:28:11,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-02-05 19:28:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2025-02-05 19:28:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.493734335839599) internal successors, (1192), 798 states have internal predecessors, (1192), 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-02-05 19:28:11,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1192 transitions. [2025-02-05 19:28:11,757 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1192 transitions. Word has length 406 [2025-02-05 19:28:11,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:11,757 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1192 transitions. [2025-02-05 19:28:11,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 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-02-05 19:28:11,757 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1192 transitions. [2025-02-05 19:28:11,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-02-05 19:28:11,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:11,759 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:11,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 19:28:11,760 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:11,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:11,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1353724722, now seen corresponding path program 1 times [2025-02-05 19:28:11,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:11,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884572751] [2025-02-05 19:28:11,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:11,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:11,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-02-05 19:28:11,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-02-05 19:28:11,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:11,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:12,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:12,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884572751] [2025-02-05 19:28:12,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884572751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:12,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:12,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:28:12,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191574329] [2025-02-05 19:28:12,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:12,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:28:12,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:12,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:28:12,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:28:12,359 INFO L87 Difference]: Start difference. First operand 799 states and 1192 transitions. Second operand has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 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-02-05 19:28:12,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:12,600 INFO L93 Difference]: Finished difference Result 1526 states and 2278 transitions. [2025-02-05 19:28:12,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:28:12,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 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 407 [2025-02-05 19:28:12,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:12,602 INFO L225 Difference]: With dead ends: 1526 [2025-02-05 19:28:12,602 INFO L226 Difference]: Without dead ends: 799 [2025-02-05 19:28:12,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:28:12,606 INFO L435 NwaCegarLoop]: 959 mSDtfsCounter, 1023 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:12,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 1916 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:28:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-02-05 19:28:12,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2025-02-05 19:28:12,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.4924812030075187) internal successors, (1191), 798 states have internal predecessors, (1191), 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-02-05 19:28:12,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1191 transitions. [2025-02-05 19:28:12,617 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1191 transitions. Word has length 407 [2025-02-05 19:28:12,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:12,618 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1191 transitions. [2025-02-05 19:28:12,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 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-02-05 19:28:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1191 transitions. [2025-02-05 19:28:12,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-02-05 19:28:12,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:12,620 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:12,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 19:28:12,620 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:12,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:12,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1804111555, now seen corresponding path program 1 times [2025-02-05 19:28:12,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:12,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602481458] [2025-02-05 19:28:12,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:12,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:12,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-05 19:28:12,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-05 19:28:12,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:12,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:13,216 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:13,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:13,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602481458] [2025-02-05 19:28:13,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602481458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:13,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:13,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:28:13,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696629283] [2025-02-05 19:28:13,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:13,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:28:13,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:13,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:28:13,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:28:13,218 INFO L87 Difference]: Start difference. First operand 799 states and 1191 transitions. Second operand has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 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-02-05 19:28:13,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:13,474 INFO L93 Difference]: Finished difference Result 1526 states and 2276 transitions. [2025-02-05 19:28:13,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:28:13,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 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 408 [2025-02-05 19:28:13,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:13,477 INFO L225 Difference]: With dead ends: 1526 [2025-02-05 19:28:13,477 INFO L226 Difference]: Without dead ends: 799 [2025-02-05 19:28:13,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:28:13,478 INFO L435 NwaCegarLoop]: 958 mSDtfsCounter, 995 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:13,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 1914 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:28:13,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-02-05 19:28:13,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2025-02-05 19:28:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.4912280701754386) internal successors, (1190), 798 states have internal predecessors, (1190), 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-02-05 19:28:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1190 transitions. [2025-02-05 19:28:13,488 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1190 transitions. Word has length 408 [2025-02-05 19:28:13,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:13,488 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1190 transitions. [2025-02-05 19:28:13,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 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-02-05 19:28:13,489 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1190 transitions. [2025-02-05 19:28:13,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-02-05 19:28:13,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:13,491 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:13,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 19:28:13,491 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:13,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:13,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1106165681, now seen corresponding path program 1 times [2025-02-05 19:28:13,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:13,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23789756] [2025-02-05 19:28:13,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:13,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:13,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-02-05 19:28:13,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-02-05 19:28:13,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:13,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:14,225 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:14,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:14,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23789756] [2025-02-05 19:28:14,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23789756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:14,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:14,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:28:14,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102788308] [2025-02-05 19:28:14,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:14,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:28:14,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:14,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:28:14,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:28:14,229 INFO L87 Difference]: Start difference. First operand 799 states and 1190 transitions. Second operand has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 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-02-05 19:28:14,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:14,479 INFO L93 Difference]: Finished difference Result 1526 states and 2274 transitions. [2025-02-05 19:28:14,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:28:14,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 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 409 [2025-02-05 19:28:14,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:14,482 INFO L225 Difference]: With dead ends: 1526 [2025-02-05 19:28:14,482 INFO L226 Difference]: Without dead ends: 799 [2025-02-05 19:28:14,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:28:14,483 INFO L435 NwaCegarLoop]: 957 mSDtfsCounter, 967 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:14,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 1912 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:28:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-02-05 19:28:14,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2025-02-05 19:28:14,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.4899749373433584) internal successors, (1189), 798 states have internal predecessors, (1189), 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-02-05 19:28:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1189 transitions. [2025-02-05 19:28:14,494 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1189 transitions. Word has length 409 [2025-02-05 19:28:14,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:14,495 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1189 transitions. [2025-02-05 19:28:14,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 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-02-05 19:28:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1189 transitions. [2025-02-05 19:28:14,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-02-05 19:28:14,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:14,497 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:14,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 19:28:14,498 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:14,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:14,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1085119872, now seen corresponding path program 1 times [2025-02-05 19:28:14,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:14,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544555030] [2025-02-05 19:28:14,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:14,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:14,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-02-05 19:28:14,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-02-05 19:28:14,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:14,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:14,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:14,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544555030] [2025-02-05 19:28:14,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544555030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:14,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:14,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:28:14,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910684718] [2025-02-05 19:28:14,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:14,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:28:14,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:14,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:28:14,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:28:14,982 INFO L87 Difference]: Start difference. First operand 799 states and 1189 transitions. Second operand has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 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-02-05 19:28:15,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:15,243 INFO L93 Difference]: Finished difference Result 1526 states and 2272 transitions. [2025-02-05 19:28:15,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:28:15,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 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 410 [2025-02-05 19:28:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:15,246 INFO L225 Difference]: With dead ends: 1526 [2025-02-05 19:28:15,246 INFO L226 Difference]: Without dead ends: 799 [2025-02-05 19:28:15,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:28:15,248 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 939 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:15,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 1910 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:28:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-02-05 19:28:15,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2025-02-05 19:28:15,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.4887218045112782) internal successors, (1188), 798 states have internal predecessors, (1188), 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-02-05 19:28:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1188 transitions. [2025-02-05 19:28:15,259 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1188 transitions. Word has length 410 [2025-02-05 19:28:15,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:15,259 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1188 transitions. [2025-02-05 19:28:15,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 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-02-05 19:28:15,259 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1188 transitions. [2025-02-05 19:28:15,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-02-05 19:28:15,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:15,261 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:15,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 19:28:15,261 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:15,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:15,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1974250004, now seen corresponding path program 1 times [2025-02-05 19:28:15,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:15,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715652826] [2025-02-05 19:28:15,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:15,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:15,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-02-05 19:28:15,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-02-05 19:28:15,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:15,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:15,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:15,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715652826] [2025-02-05 19:28:15,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715652826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:15,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:15,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:28:15,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050601306] [2025-02-05 19:28:15,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:15,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:28:15,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:15,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:28:15,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:28:15,712 INFO L87 Difference]: Start difference. First operand 799 states and 1188 transitions. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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-02-05 19:28:15,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:15,965 INFO L93 Difference]: Finished difference Result 1526 states and 2270 transitions. [2025-02-05 19:28:15,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:28:15,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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 411 [2025-02-05 19:28:15,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:15,967 INFO L225 Difference]: With dead ends: 1526 [2025-02-05 19:28:15,967 INFO L226 Difference]: Without dead ends: 799 [2025-02-05 19:28:15,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:28:15,969 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 911 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:15,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 1908 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:28:15,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-02-05 19:28:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2025-02-05 19:28:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.487468671679198) internal successors, (1187), 798 states have internal predecessors, (1187), 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-02-05 19:28:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1187 transitions. [2025-02-05 19:28:15,978 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1187 transitions. Word has length 411 [2025-02-05 19:28:15,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:15,978 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1187 transitions. [2025-02-05 19:28:15,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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-02-05 19:28:15,978 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1187 transitions. [2025-02-05 19:28:15,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-02-05 19:28:15,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:15,980 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:15,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 19:28:15,980 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:15,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:15,980 INFO L85 PathProgramCache]: Analyzing trace with hash 889914179, now seen corresponding path program 1 times [2025-02-05 19:28:15,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:15,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359739634] [2025-02-05 19:28:15,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:15,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:16,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-02-05 19:28:16,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-02-05 19:28:16,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:16,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 19:28:16,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:16,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359739634] [2025-02-05 19:28:16,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359739634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:16,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:16,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:28:16,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549506411] [2025-02-05 19:28:16,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:16,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:28:16,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:16,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:28:16,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:28:16,686 INFO L87 Difference]: Start difference. First operand 799 states and 1187 transitions. Second operand has 5 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 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-02-05 19:28:17,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:17,043 INFO L93 Difference]: Finished difference Result 1530 states and 2273 transitions. [2025-02-05 19:28:17,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:28:17,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 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 412 [2025-02-05 19:28:17,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:17,047 INFO L225 Difference]: With dead ends: 1530 [2025-02-05 19:28:17,047 INFO L226 Difference]: Without dead ends: 803 [2025-02-05 19:28:17,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:28:17,048 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 0 mSDsluCounter, 2857 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3817 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:17,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3817 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 19:28:17,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-02-05 19:28:17,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 799. [2025-02-05 19:28:17,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.487468671679198) internal successors, (1187), 798 states have internal predecessors, (1187), 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-02-05 19:28:17,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1187 transitions. [2025-02-05 19:28:17,059 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1187 transitions. Word has length 412 [2025-02-05 19:28:17,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:17,059 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1187 transitions. [2025-02-05 19:28:17,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 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-02-05 19:28:17,060 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1187 transitions. [2025-02-05 19:28:17,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-02-05 19:28:17,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:17,061 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:17,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 19:28:17,062 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:17,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:17,062 INFO L85 PathProgramCache]: Analyzing trace with hash -589067808, now seen corresponding path program 1 times [2025-02-05 19:28:17,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:17,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344921919] [2025-02-05 19:28:17,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:17,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:17,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-02-05 19:28:17,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-02-05 19:28:17,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:17,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:17,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:17,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344921919] [2025-02-05 19:28:17,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344921919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:17,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:17,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:28:17,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161889499] [2025-02-05 19:28:17,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:17,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:28:17,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:17,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:28:17,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:17,849 INFO L87 Difference]: Start difference. First operand 799 states and 1187 transitions. Second operand has 6 states, 6 states have (on average 68.83333333333333) internal successors, (413), 6 states have internal predecessors, (413), 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-02-05 19:28:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:18,398 INFO L93 Difference]: Finished difference Result 1532 states and 2276 transitions. [2025-02-05 19:28:18,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:28:18,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 68.83333333333333) internal successors, (413), 6 states have internal predecessors, (413), 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 413 [2025-02-05 19:28:18,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:18,401 INFO L225 Difference]: With dead ends: 1532 [2025-02-05 19:28:18,401 INFO L226 Difference]: Without dead ends: 803 [2025-02-05 19:28:18,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:18,402 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 1092 mSDsluCounter, 2667 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 3561 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:18,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 3561 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:28:18,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-02-05 19:28:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 801. [2025-02-05 19:28:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 800 states have (on average 1.48625) internal successors, (1189), 800 states have internal predecessors, (1189), 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-02-05 19:28:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1189 transitions. [2025-02-05 19:28:18,410 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1189 transitions. Word has length 413 [2025-02-05 19:28:18,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:18,410 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1189 transitions. [2025-02-05 19:28:18,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.83333333333333) internal successors, (413), 6 states have internal predecessors, (413), 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-02-05 19:28:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1189 transitions. [2025-02-05 19:28:18,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-02-05 19:28:18,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:18,412 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:18,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 19:28:18,412 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:18,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:18,412 INFO L85 PathProgramCache]: Analyzing trace with hash 427641421, now seen corresponding path program 1 times [2025-02-05 19:28:18,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:18,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126112505] [2025-02-05 19:28:18,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:18,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:18,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-02-05 19:28:18,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-02-05 19:28:18,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:18,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:19,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:19,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126112505] [2025-02-05 19:28:19,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126112505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:19,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:19,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:28:19,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85808446] [2025-02-05 19:28:19,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:19,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:28:19,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:19,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:28:19,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:19,065 INFO L87 Difference]: Start difference. First operand 801 states and 1189 transitions. Second operand has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 states have internal predecessors, (414), 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-02-05 19:28:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:19,611 INFO L93 Difference]: Finished difference Result 1536 states and 2280 transitions. [2025-02-05 19:28:19,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:28:19,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 states have internal predecessors, (414), 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 414 [2025-02-05 19:28:19,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:19,613 INFO L225 Difference]: With dead ends: 1536 [2025-02-05 19:28:19,613 INFO L226 Difference]: Without dead ends: 805 [2025-02-05 19:28:19,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:19,614 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 1152 mSDsluCounter, 2665 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 3559 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:19,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 3559 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:28:19,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-02-05 19:28:19,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 803. [2025-02-05 19:28:19,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 802 states have (on average 1.4850374064837906) internal successors, (1191), 802 states have internal predecessors, (1191), 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-02-05 19:28:19,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1191 transitions. [2025-02-05 19:28:19,625 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1191 transitions. Word has length 414 [2025-02-05 19:28:19,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:19,626 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1191 transitions. [2025-02-05 19:28:19,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 states have internal predecessors, (414), 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-02-05 19:28:19,626 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1191 transitions. [2025-02-05 19:28:19,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-02-05 19:28:19,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:19,629 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:19,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 19:28:19,629 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:19,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:19,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1115687906, now seen corresponding path program 1 times [2025-02-05 19:28:19,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:19,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457352588] [2025-02-05 19:28:19,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:19,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:19,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-02-05 19:28:19,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-02-05 19:28:19,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:19,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:20,241 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:20,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:20,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457352588] [2025-02-05 19:28:20,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457352588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:20,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:20,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:28:20,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602066774] [2025-02-05 19:28:20,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:20,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:28:20,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:20,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:28:20,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:20,242 INFO L87 Difference]: Start difference. First operand 803 states and 1191 transitions. Second operand has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 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-02-05 19:28:20,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:20,722 INFO L93 Difference]: Finished difference Result 1540 states and 2284 transitions. [2025-02-05 19:28:20,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:28:20,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 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 415 [2025-02-05 19:28:20,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:20,725 INFO L225 Difference]: With dead ends: 1540 [2025-02-05 19:28:20,725 INFO L226 Difference]: Without dead ends: 807 [2025-02-05 19:28:20,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:20,726 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 1142 mSDsluCounter, 2667 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 3561 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:20,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 3561 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:28:20,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2025-02-05 19:28:20,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 805. [2025-02-05 19:28:20,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 804 states have (on average 1.4838308457711442) internal successors, (1193), 804 states have internal predecessors, (1193), 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-02-05 19:28:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1193 transitions. [2025-02-05 19:28:20,735 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1193 transitions. Word has length 415 [2025-02-05 19:28:20,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:20,736 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1193 transitions. [2025-02-05 19:28:20,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 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-02-05 19:28:20,736 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1193 transitions. [2025-02-05 19:28:20,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-02-05 19:28:20,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:20,738 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:20,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 19:28:20,738 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:20,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:20,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1475493135, now seen corresponding path program 1 times [2025-02-05 19:28:20,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:20,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009752469] [2025-02-05 19:28:20,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:20,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:20,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-02-05 19:28:20,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-02-05 19:28:20,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:20,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:21,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:21,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009752469] [2025-02-05 19:28:21,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009752469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:21,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:21,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:28:21,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411818259] [2025-02-05 19:28:21,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:21,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:28:21,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:21,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:28:21,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:21,336 INFO L87 Difference]: Start difference. First operand 805 states and 1193 transitions. Second operand has 6 states, 6 states have (on average 69.33333333333333) internal successors, (416), 6 states have internal predecessors, (416), 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-02-05 19:28:21,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:21,774 INFO L93 Difference]: Finished difference Result 1544 states and 2288 transitions. [2025-02-05 19:28:21,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:28:21,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 69.33333333333333) internal successors, (416), 6 states have internal predecessors, (416), 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 416 [2025-02-05 19:28:21,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:21,776 INFO L225 Difference]: With dead ends: 1544 [2025-02-05 19:28:21,776 INFO L226 Difference]: Without dead ends: 809 [2025-02-05 19:28:21,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:21,777 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 1140 mSDsluCounter, 2665 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 3559 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:21,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 3559 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 19:28:21,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-02-05 19:28:21,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 807. [2025-02-05 19:28:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 806 states have (on average 1.4826302729528535) internal successors, (1195), 806 states have internal predecessors, (1195), 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-02-05 19:28:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1195 transitions. [2025-02-05 19:28:21,784 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1195 transitions. Word has length 416 [2025-02-05 19:28:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:21,784 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1195 transitions. [2025-02-05 19:28:21,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.33333333333333) internal successors, (416), 6 states have internal predecessors, (416), 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-02-05 19:28:21,785 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1195 transitions. [2025-02-05 19:28:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-02-05 19:28:21,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:21,786 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:21,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 19:28:21,787 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:21,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:21,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1363346340, now seen corresponding path program 1 times [2025-02-05 19:28:21,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:21,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676676249] [2025-02-05 19:28:21,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:21,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:21,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-02-05 19:28:21,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-02-05 19:28:21,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:21,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:22,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:22,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676676249] [2025-02-05 19:28:22,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676676249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:22,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:22,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:28:22,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244153445] [2025-02-05 19:28:22,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:22,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:28:22,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:22,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:28:22,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:22,400 INFO L87 Difference]: Start difference. First operand 807 states and 1195 transitions. Second operand has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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-02-05 19:28:22,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:22,982 INFO L93 Difference]: Finished difference Result 1548 states and 2292 transitions. [2025-02-05 19:28:22,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:28:22,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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 417 [2025-02-05 19:28:22,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:22,984 INFO L225 Difference]: With dead ends: 1548 [2025-02-05 19:28:22,984 INFO L226 Difference]: Without dead ends: 811 [2025-02-05 19:28:22,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:22,985 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 1134 mSDsluCounter, 2667 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 3561 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:22,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 3561 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:28:22,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2025-02-05 19:28:22,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 809. [2025-02-05 19:28:22,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 808 states have (on average 1.4814356435643565) internal successors, (1197), 808 states have internal predecessors, (1197), 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-02-05 19:28:22,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1197 transitions. [2025-02-05 19:28:22,996 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1197 transitions. Word has length 417 [2025-02-05 19:28:22,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:22,997 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1197 transitions. [2025-02-05 19:28:22,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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-02-05 19:28:22,997 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1197 transitions. [2025-02-05 19:28:22,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2025-02-05 19:28:22,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:22,999 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:22,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 19:28:22,999 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:22,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1052238289, now seen corresponding path program 1 times [2025-02-05 19:28:22,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:22,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515930786] [2025-02-05 19:28:22,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:22,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:23,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-02-05 19:28:23,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-02-05 19:28:23,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:23,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:24,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:24,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515930786] [2025-02-05 19:28:24,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515930786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:24,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:24,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:28:24,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503593015] [2025-02-05 19:28:24,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:24,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:28:24,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:24,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:28:24,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:24,402 INFO L87 Difference]: Start difference. First operand 809 states and 1197 transitions. Second operand has 6 states, 6 states have (on average 69.66666666666667) internal successors, (418), 6 states have internal predecessors, (418), 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-02-05 19:28:24,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:24,951 INFO L93 Difference]: Finished difference Result 1883 states and 2783 transitions. [2025-02-05 19:28:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:28:24,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 69.66666666666667) internal successors, (418), 6 states have internal predecessors, (418), 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 418 [2025-02-05 19:28:24,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:24,954 INFO L225 Difference]: With dead ends: 1883 [2025-02-05 19:28:24,954 INFO L226 Difference]: Without dead ends: 1144 [2025-02-05 19:28:24,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:28:24,959 INFO L435 NwaCegarLoop]: 1204 mSDtfsCounter, 1612 mSDsluCounter, 3320 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1612 SdHoareTripleChecker+Valid, 4524 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:24,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1612 Valid, 4524 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:28:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2025-02-05 19:28:24,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 915. [2025-02-05 19:28:24,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 914 states have (on average 1.473741794310722) internal successors, (1347), 914 states have internal predecessors, (1347), 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-02-05 19:28:24,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1347 transitions. [2025-02-05 19:28:24,971 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1347 transitions. Word has length 418 [2025-02-05 19:28:24,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:24,971 INFO L471 AbstractCegarLoop]: Abstraction has 915 states and 1347 transitions. [2025-02-05 19:28:24,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.66666666666667) internal successors, (418), 6 states have internal predecessors, (418), 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-02-05 19:28:24,971 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1347 transitions. [2025-02-05 19:28:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2025-02-05 19:28:24,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:24,973 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:24,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 19:28:24,973 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:24,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:24,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1617928914, now seen corresponding path program 1 times [2025-02-05 19:28:24,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:24,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344277974] [2025-02-05 19:28:24,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:24,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:25,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-02-05 19:28:25,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-02-05 19:28:25,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:25,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:26,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:26,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344277974] [2025-02-05 19:28:26,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344277974] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 19:28:26,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26559483] [2025-02-05 19:28:26,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:26,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:28:26,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:28:26,464 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 19:28:26,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 19:28:27,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-02-05 19:28:27,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-02-05 19:28:27,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:27,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:27,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 2536 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 19:28:27,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:28:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:27,954 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 19:28:27,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26559483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:27,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 19:28:27,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-02-05 19:28:27,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339026760] [2025-02-05 19:28:27,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:27,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:28:27,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:27,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:28:27,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:28:27,955 INFO L87 Difference]: Start difference. First operand 915 states and 1347 transitions. Second operand has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 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-02-05 19:28:28,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:28,526 INFO L93 Difference]: Finished difference Result 2020 states and 2976 transitions. [2025-02-05 19:28:28,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:28:28,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 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 419 [2025-02-05 19:28:28,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:28,529 INFO L225 Difference]: With dead ends: 2020 [2025-02-05 19:28:28,529 INFO L226 Difference]: Without dead ends: 1175 [2025-02-05 19:28:28,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-05 19:28:28,530 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 1818 mSDsluCounter, 2751 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1818 SdHoareTripleChecker+Valid, 3672 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:28,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1818 Valid, 3672 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:28:28,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-02-05 19:28:28,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 929. [2025-02-05 19:28:28,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 928 states have (on average 1.4730603448275863) internal successors, (1367), 928 states have internal predecessors, (1367), 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-02-05 19:28:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1367 transitions. [2025-02-05 19:28:28,539 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1367 transitions. Word has length 419 [2025-02-05 19:28:28,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:28,539 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1367 transitions. [2025-02-05 19:28:28,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 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-02-05 19:28:28,539 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1367 transitions. [2025-02-05 19:28:28,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2025-02-05 19:28:28,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:28,541 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:28,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 19:28:28,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:28:28,745 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:28,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:28,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1466994921, now seen corresponding path program 1 times [2025-02-05 19:28:28,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:28,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939452687] [2025-02-05 19:28:28,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:28,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:28,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-02-05 19:28:28,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-02-05 19:28:28,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:28,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:29,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:29,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939452687] [2025-02-05 19:28:29,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939452687] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:29,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:29,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:28:29,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376948220] [2025-02-05 19:28:29,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:29,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:28:29,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:29,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:28:29,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:28:29,463 INFO L87 Difference]: Start difference. First operand 929 states and 1367 transitions. Second operand has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 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-02-05 19:28:30,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:30,021 INFO L93 Difference]: Finished difference Result 2031 states and 2991 transitions. [2025-02-05 19:28:30,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:28:30,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 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 419 [2025-02-05 19:28:30,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:30,025 INFO L225 Difference]: With dead ends: 2031 [2025-02-05 19:28:30,025 INFO L226 Difference]: Without dead ends: 1158 [2025-02-05 19:28:30,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:28:30,027 INFO L435 NwaCegarLoop]: 1230 mSDtfsCounter, 1658 mSDsluCounter, 4612 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1658 SdHoareTripleChecker+Valid, 5842 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:30,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1658 Valid, 5842 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:28:30,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2025-02-05 19:28:30,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 929. [2025-02-05 19:28:30,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 928 states have (on average 1.4719827586206897) internal successors, (1366), 928 states have internal predecessors, (1366), 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-02-05 19:28:30,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1366 transitions. [2025-02-05 19:28:30,036 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1366 transitions. Word has length 419 [2025-02-05 19:28:30,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:30,037 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1366 transitions. [2025-02-05 19:28:30,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 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-02-05 19:28:30,037 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1366 transitions. [2025-02-05 19:28:30,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-02-05 19:28:30,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:30,039 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:30,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 19:28:30,040 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:30,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:30,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1829563508, now seen corresponding path program 1 times [2025-02-05 19:28:30,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:30,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009190634] [2025-02-05 19:28:30,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:30,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:30,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-02-05 19:28:30,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-02-05 19:28:30,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:30,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:31,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:31,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009190634] [2025-02-05 19:28:31,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009190634] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 19:28:31,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851431894] [2025-02-05 19:28:31,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:31,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:28:31,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:28:31,257 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 19:28:31,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 19:28:31,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-02-05 19:28:32,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-02-05 19:28:32,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:32,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:32,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 2539 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-05 19:28:32,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:28:33,289 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:33,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 19:28:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:34,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851431894] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 19:28:34,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 19:28:34,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6, 20] total 35 [2025-02-05 19:28:34,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6569344] [2025-02-05 19:28:34,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:34,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 19:28:34,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:34,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 19:28:34,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 19:28:34,537 INFO L87 Difference]: Start difference. First operand 929 states and 1366 transitions. Second operand has 13 states, 13 states have (on average 32.30769230769231) internal successors, (420), 13 states have internal predecessors, (420), 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-02-05 19:28:36,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:36,776 INFO L93 Difference]: Finished difference Result 3122 states and 4602 transitions. [2025-02-05 19:28:36,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 19:28:36,777 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 32.30769230769231) internal successors, (420), 13 states have internal predecessors, (420), 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 420 [2025-02-05 19:28:36,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:36,781 INFO L225 Difference]: With dead ends: 3122 [2025-02-05 19:28:36,781 INFO L226 Difference]: Without dead ends: 2263 [2025-02-05 19:28:36,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 859 GetRequests, 813 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=233, Invalid=2023, Unknown=0, NotChecked=0, Total=2256 [2025-02-05 19:28:36,783 INFO L435 NwaCegarLoop]: 1746 mSDtfsCounter, 2078 mSDsluCounter, 13137 mSDsCounter, 0 mSdLazyCounter, 3393 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2078 SdHoareTripleChecker+Valid, 14883 SdHoareTripleChecker+Invalid, 3397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:36,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2078 Valid, 14883 Invalid, 3397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3393 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 19:28:36,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2025-02-05 19:28:36,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 1188. [2025-02-05 19:28:36,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 1187 states have (on average 1.4776748104465038) internal successors, (1754), 1187 states have internal predecessors, (1754), 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-02-05 19:28:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1754 transitions. [2025-02-05 19:28:36,796 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1754 transitions. Word has length 420 [2025-02-05 19:28:36,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:36,797 INFO L471 AbstractCegarLoop]: Abstraction has 1188 states and 1754 transitions. [2025-02-05 19:28:36,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 32.30769230769231) internal successors, (420), 13 states have internal predecessors, (420), 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-02-05 19:28:36,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1754 transitions. [2025-02-05 19:28:36,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-02-05 19:28:36,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:36,799 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:36,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 19:28:37,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:28:37,000 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:37,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:37,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1275383459, now seen corresponding path program 1 times [2025-02-05 19:28:37,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:37,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869839630] [2025-02-05 19:28:37,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:37,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:37,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-02-05 19:28:37,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-02-05 19:28:37,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:37,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:38,043 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:38,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:38,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869839630] [2025-02-05 19:28:38,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869839630] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 19:28:38,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223046127] [2025-02-05 19:28:38,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:38,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:28:38,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:28:38,048 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 19:28:38,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 19:28:38,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-02-05 19:28:39,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-02-05 19:28:39,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:39,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:39,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 2542 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 19:28:39,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:28:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:39,371 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 19:28:39,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223046127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:39,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 19:28:39,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-02-05 19:28:39,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841966150] [2025-02-05 19:28:39,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:39,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:28:39,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:39,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:28:39,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 19:28:39,375 INFO L87 Difference]: Start difference. First operand 1188 states and 1754 transitions. Second operand has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 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-02-05 19:28:40,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:40,003 INFO L93 Difference]: Finished difference Result 3284 states and 4846 transitions. [2025-02-05 19:28:40,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:28:40,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 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 421 [2025-02-05 19:28:40,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:40,009 INFO L225 Difference]: With dead ends: 3284 [2025-02-05 19:28:40,009 INFO L226 Difference]: Without dead ends: 1192 [2025-02-05 19:28:40,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:28:40,015 INFO L435 NwaCegarLoop]: 1360 mSDtfsCounter, 705 mSDsluCounter, 3432 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 4792 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:40,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 4792 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:28:40,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2025-02-05 19:28:40,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1190. [2025-02-05 19:28:40,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1189 states have (on average 1.4768713204373423) internal successors, (1756), 1189 states have internal predecessors, (1756), 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-02-05 19:28:40,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1756 transitions. [2025-02-05 19:28:40,039 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1756 transitions. Word has length 421 [2025-02-05 19:28:40,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:40,039 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1756 transitions. [2025-02-05 19:28:40,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 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-02-05 19:28:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1756 transitions. [2025-02-05 19:28:40,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-02-05 19:28:40,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:40,043 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:40,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 19:28:40,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:28:40,247 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:40,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:40,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1084971158, now seen corresponding path program 1 times [2025-02-05 19:28:40,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:40,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982576355] [2025-02-05 19:28:40,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:40,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:40,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-02-05 19:28:40,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-02-05 19:28:40,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:40,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:41,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:41,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982576355] [2025-02-05 19:28:41,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982576355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:41,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:41,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:28:41,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470856552] [2025-02-05 19:28:41,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:41,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:28:41,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:41,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:28:41,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:41,295 INFO L87 Difference]: Start difference. First operand 1190 states and 1756 transitions. Second operand has 6 states, 6 states have (on average 70.33333333333333) internal successors, (422), 6 states have internal predecessors, (422), 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-02-05 19:28:42,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:42,264 INFO L93 Difference]: Finished difference Result 5286 states and 7794 transitions. [2025-02-05 19:28:42,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:28:42,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 70.33333333333333) internal successors, (422), 6 states have internal predecessors, (422), 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 422 [2025-02-05 19:28:42,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:42,269 INFO L225 Difference]: With dead ends: 5286 [2025-02-05 19:28:42,269 INFO L226 Difference]: Without dead ends: 2274 [2025-02-05 19:28:42,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:28:42,273 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 3131 mSDsluCounter, 3369 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3131 SdHoareTripleChecker+Valid, 4278 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:42,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3131 Valid, 4278 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 19:28:42,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2025-02-05 19:28:42,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 1208. [2025-02-05 19:28:42,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 1207 states have (on average 1.476387738193869) internal successors, (1782), 1207 states have internal predecessors, (1782), 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-02-05 19:28:42,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1782 transitions. [2025-02-05 19:28:42,289 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1782 transitions. Word has length 422 [2025-02-05 19:28:42,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:42,289 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1782 transitions. [2025-02-05 19:28:42,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.33333333333333) internal successors, (422), 6 states have internal predecessors, (422), 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-02-05 19:28:42,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1782 transitions. [2025-02-05 19:28:42,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-02-05 19:28:42,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:42,291 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:42,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 19:28:42,291 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:42,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:42,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1246059863, now seen corresponding path program 1 times [2025-02-05 19:28:42,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:42,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610973649] [2025-02-05 19:28:42,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:42,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:42,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-02-05 19:28:43,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-02-05 19:28:43,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:43,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:43,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:43,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610973649] [2025-02-05 19:28:43,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610973649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:43,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:43,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:28:43,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518710549] [2025-02-05 19:28:43,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:43,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:28:43,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:43,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:28:43,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:43,645 INFO L87 Difference]: Start difference. First operand 1208 states and 1782 transitions. Second operand has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 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-02-05 19:28:44,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:44,276 INFO L93 Difference]: Finished difference Result 3336 states and 4919 transitions. [2025-02-05 19:28:44,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:28:44,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 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 423 [2025-02-05 19:28:44,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:44,280 INFO L225 Difference]: With dead ends: 3336 [2025-02-05 19:28:44,280 INFO L226 Difference]: Without dead ends: 2196 [2025-02-05 19:28:44,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:44,281 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 1545 mSDsluCounter, 2287 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:44,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1545 Valid, 3058 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:28:44,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2025-02-05 19:28:44,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 1754. [2025-02-05 19:28:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1754 states, 1753 states have (on average 1.4694808899030234) internal successors, (2576), 1753 states have internal predecessors, (2576), 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-02-05 19:28:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2576 transitions. [2025-02-05 19:28:44,295 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2576 transitions. Word has length 423 [2025-02-05 19:28:44,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:44,295 INFO L471 AbstractCegarLoop]: Abstraction has 1754 states and 2576 transitions. [2025-02-05 19:28:44,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 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-02-05 19:28:44,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2576 transitions. [2025-02-05 19:28:44,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-02-05 19:28:44,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:44,297 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:44,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 19:28:44,298 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:44,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:44,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1856678581, now seen corresponding path program 1 times [2025-02-05 19:28:44,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:44,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109096868] [2025-02-05 19:28:44,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:44,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:44,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-02-05 19:28:44,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-02-05 19:28:44,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:44,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:45,760 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:45,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:45,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109096868] [2025-02-05 19:28:45,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109096868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:45,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:45,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:28:45,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044866416] [2025-02-05 19:28:45,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:45,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:28:45,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:45,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:28:45,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:45,762 INFO L87 Difference]: Start difference. First operand 1754 states and 2576 transitions. Second operand has 6 states, 6 states have (on average 70.66666666666667) internal successors, (424), 6 states have internal predecessors, (424), 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-02-05 19:28:46,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:46,371 INFO L93 Difference]: Finished difference Result 3901 states and 5743 transitions. [2025-02-05 19:28:46,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:28:46,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 70.66666666666667) internal successors, (424), 6 states have internal predecessors, (424), 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 424 [2025-02-05 19:28:46,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:46,377 INFO L225 Difference]: With dead ends: 3901 [2025-02-05 19:28:46,377 INFO L226 Difference]: Without dead ends: 2454 [2025-02-05 19:28:46,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:28:46,378 INFO L435 NwaCegarLoop]: 1028 mSDtfsCounter, 1900 mSDsluCounter, 2922 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1900 SdHoareTripleChecker+Valid, 3950 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:46,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1900 Valid, 3950 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:28:46,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2025-02-05 19:28:46,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 1934. [2025-02-05 19:28:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1934 states, 1933 states have (on average 1.4640455250905329) internal successors, (2830), 1933 states have internal predecessors, (2830), 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-02-05 19:28:46,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 2830 transitions. [2025-02-05 19:28:46,394 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 2830 transitions. Word has length 424 [2025-02-05 19:28:46,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:46,394 INFO L471 AbstractCegarLoop]: Abstraction has 1934 states and 2830 transitions. [2025-02-05 19:28:46,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.66666666666667) internal successors, (424), 6 states have internal predecessors, (424), 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-02-05 19:28:46,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2830 transitions. [2025-02-05 19:28:46,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-02-05 19:28:46,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:46,396 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:46,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 19:28:46,396 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:46,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:46,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1059997385, now seen corresponding path program 1 times [2025-02-05 19:28:46,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:46,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380371708] [2025-02-05 19:28:46,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:46,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:46,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-02-05 19:28:47,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-02-05 19:28:47,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:47,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:47,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:47,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380371708] [2025-02-05 19:28:47,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380371708] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:47,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:47,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:28:47,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081969362] [2025-02-05 19:28:47,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:47,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:28:47,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:47,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:28:47,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:47,605 INFO L87 Difference]: Start difference. First operand 1934 states and 2830 transitions. Second operand has 6 states, 6 states have (on average 70.66666666666667) internal successors, (424), 6 states have internal predecessors, (424), 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-02-05 19:28:48,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:48,589 INFO L93 Difference]: Finished difference Result 3644 states and 5356 transitions. [2025-02-05 19:28:48,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:28:48,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 70.66666666666667) internal successors, (424), 6 states have internal predecessors, (424), 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 424 [2025-02-05 19:28:48,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:48,593 INFO L225 Difference]: With dead ends: 3644 [2025-02-05 19:28:48,593 INFO L226 Difference]: Without dead ends: 2414 [2025-02-05 19:28:48,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:48,595 INFO L435 NwaCegarLoop]: 765 mSDtfsCounter, 817 mSDsluCounter, 2998 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 3763 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:48,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 3763 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 19:28:48,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2025-02-05 19:28:48,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 1958. [2025-02-05 19:28:48,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1958 states, 1957 states have (on average 1.4629535002554932) internal successors, (2863), 1957 states have internal predecessors, (2863), 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-02-05 19:28:48,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 2863 transitions. [2025-02-05 19:28:48,610 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 2863 transitions. Word has length 424 [2025-02-05 19:28:48,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:48,611 INFO L471 AbstractCegarLoop]: Abstraction has 1958 states and 2863 transitions. [2025-02-05 19:28:48,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.66666666666667) internal successors, (424), 6 states have internal predecessors, (424), 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-02-05 19:28:48,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 2863 transitions. [2025-02-05 19:28:48,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-02-05 19:28:48,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:48,613 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:48,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 19:28:48,613 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:48,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:48,613 INFO L85 PathProgramCache]: Analyzing trace with hash -287324730, now seen corresponding path program 1 times [2025-02-05 19:28:48,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:48,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53146125] [2025-02-05 19:28:48,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:48,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:48,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-02-05 19:28:49,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-02-05 19:28:49,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:49,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:49,629 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:49,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:49,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53146125] [2025-02-05 19:28:49,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53146125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:49,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:49,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:28:49,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133327443] [2025-02-05 19:28:49,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:49,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:28:49,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:49,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:28:49,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:49,631 INFO L87 Difference]: Start difference. First operand 1958 states and 2863 transitions. Second operand has 6 states, 6 states have (on average 70.83333333333333) internal successors, (425), 6 states have internal predecessors, (425), 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-02-05 19:28:50,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:50,612 INFO L93 Difference]: Finished difference Result 5668 states and 8285 transitions. [2025-02-05 19:28:50,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:28:50,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 70.83333333333333) internal successors, (425), 6 states have internal predecessors, (425), 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 425 [2025-02-05 19:28:50,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:50,619 INFO L225 Difference]: With dead ends: 5668 [2025-02-05 19:28:50,619 INFO L226 Difference]: Without dead ends: 4438 [2025-02-05 19:28:50,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:50,621 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 1346 mSDsluCounter, 3691 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 4475 SdHoareTripleChecker+Invalid, 2031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:50,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1346 Valid, 4475 Invalid, 2031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1990 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 19:28:50,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4438 states. [2025-02-05 19:28:50,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4438 to 3914. [2025-02-05 19:28:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3914 states, 3913 states have (on average 1.4548939432660364) internal successors, (5693), 3913 states have internal predecessors, (5693), 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-02-05 19:28:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3914 states to 3914 states and 5693 transitions. [2025-02-05 19:28:50,697 INFO L78 Accepts]: Start accepts. Automaton has 3914 states and 5693 transitions. Word has length 425 [2025-02-05 19:28:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:50,698 INFO L471 AbstractCegarLoop]: Abstraction has 3914 states and 5693 transitions. [2025-02-05 19:28:50,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.83333333333333) internal successors, (425), 6 states have internal predecessors, (425), 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-02-05 19:28:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3914 states and 5693 transitions. [2025-02-05 19:28:50,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-02-05 19:28:50,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:50,705 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:50,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 19:28:50,705 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:50,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:50,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1902746330, now seen corresponding path program 1 times [2025-02-05 19:28:50,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:50,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673573132] [2025-02-05 19:28:50,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:50,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:50,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-02-05 19:28:51,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-02-05 19:28:51,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:51,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:52,220 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:52,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:52,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673573132] [2025-02-05 19:28:52,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673573132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:52,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:52,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:28:52,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548420283] [2025-02-05 19:28:52,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:52,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:28:52,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:52,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:28:52,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:52,222 INFO L87 Difference]: Start difference. First operand 3914 states and 5693 transitions. Second operand has 6 states, 6 states have (on average 71.0) internal successors, (426), 6 states have internal predecessors, (426), 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-02-05 19:28:53,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:53,134 INFO L93 Difference]: Finished difference Result 6728 states and 9808 transitions. [2025-02-05 19:28:53,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:28:53,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 71.0) internal successors, (426), 6 states have internal predecessors, (426), 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 426 [2025-02-05 19:28:53,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:53,140 INFO L225 Difference]: With dead ends: 6728 [2025-02-05 19:28:53,140 INFO L226 Difference]: Without dead ends: 4204 [2025-02-05 19:28:53,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:53,143 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 1754 mSDsluCounter, 2372 mSDsCounter, 0 mSdLazyCounter, 2010 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 3210 SdHoareTripleChecker+Invalid, 2011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:53,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1754 Valid, 3210 Invalid, 2011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2010 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 19:28:53,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4204 states. [2025-02-05 19:28:53,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4204 to 3322. [2025-02-05 19:28:53,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3322 states, 3321 states have (on average 1.4561878952122855) internal successors, (4836), 3321 states have internal predecessors, (4836), 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-02-05 19:28:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3322 states to 3322 states and 4836 transitions. [2025-02-05 19:28:53,168 INFO L78 Accepts]: Start accepts. Automaton has 3322 states and 4836 transitions. Word has length 426 [2025-02-05 19:28:53,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:53,168 INFO L471 AbstractCegarLoop]: Abstraction has 3322 states and 4836 transitions. [2025-02-05 19:28:53,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.0) internal successors, (426), 6 states have internal predecessors, (426), 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-02-05 19:28:53,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3322 states and 4836 transitions. [2025-02-05 19:28:53,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-02-05 19:28:53,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:53,171 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:53,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 19:28:53,171 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:53,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:53,172 INFO L85 PathProgramCache]: Analyzing trace with hash -14224182, now seen corresponding path program 1 times [2025-02-05 19:28:53,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:53,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238018592] [2025-02-05 19:28:53,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:53,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:53,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-02-05 19:28:53,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-02-05 19:28:53,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:53,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:54,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:54,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238018592] [2025-02-05 19:28:54,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238018592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:54,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:54,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:28:54,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870042972] [2025-02-05 19:28:54,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:54,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:28:54,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:54,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:28:54,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:54,475 INFO L87 Difference]: Start difference. First operand 3322 states and 4836 transitions. Second operand has 6 states, 6 states have (on average 71.0) internal successors, (426), 6 states have internal predecessors, (426), 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-02-05 19:28:55,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:55,500 INFO L93 Difference]: Finished difference Result 5736 states and 8380 transitions. [2025-02-05 19:28:55,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:28:55,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 71.0) internal successors, (426), 6 states have internal predecessors, (426), 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 426 [2025-02-05 19:28:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:55,506 INFO L225 Difference]: With dead ends: 5736 [2025-02-05 19:28:55,506 INFO L226 Difference]: Without dead ends: 3804 [2025-02-05 19:28:55,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:55,509 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 805 mSDsluCounter, 2999 mSDsCounter, 0 mSdLazyCounter, 1795 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 3765 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:55,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 3765 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1795 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 19:28:55,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3804 states. [2025-02-05 19:28:55,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3804 to 3388. [2025-02-05 19:28:55,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3388 states, 3387 states have (on average 1.455565397106584) internal successors, (4930), 3387 states have internal predecessors, (4930), 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-02-05 19:28:55,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4930 transitions. [2025-02-05 19:28:55,567 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4930 transitions. Word has length 426 [2025-02-05 19:28:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:55,568 INFO L471 AbstractCegarLoop]: Abstraction has 3388 states and 4930 transitions. [2025-02-05 19:28:55,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.0) internal successors, (426), 6 states have internal predecessors, (426), 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-02-05 19:28:55,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4930 transitions. [2025-02-05 19:28:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-02-05 19:28:55,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:55,571 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:55,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 19:28:55,571 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:55,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:55,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1916593388, now seen corresponding path program 1 times [2025-02-05 19:28:55,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:55,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315262819] [2025-02-05 19:28:55,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:55,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:55,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-02-05 19:28:56,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-02-05 19:28:56,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:56,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:56,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:56,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315262819] [2025-02-05 19:28:56,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315262819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:56,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:56,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:28:56,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233103746] [2025-02-05 19:28:56,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:56,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:28:56,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:56,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:28:56,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:56,902 INFO L87 Difference]: Start difference. First operand 3388 states and 4930 transitions. Second operand has 6 states, 6 states have (on average 71.16666666666667) internal successors, (427), 6 states have internal predecessors, (427), 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-02-05 19:28:57,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:28:57,739 INFO L93 Difference]: Finished difference Result 9010 states and 13105 transitions. [2025-02-05 19:28:57,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:28:57,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 71.16666666666667) internal successors, (427), 6 states have internal predecessors, (427), 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 427 [2025-02-05 19:28:57,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:28:57,746 INFO L225 Difference]: With dead ends: 9010 [2025-02-05 19:28:57,746 INFO L226 Difference]: Without dead ends: 7078 [2025-02-05 19:28:57,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:28:57,749 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 1835 mSDsluCounter, 2854 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1835 SdHoareTripleChecker+Valid, 3782 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 19:28:57,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1835 Valid, 3782 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 19:28:57,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7078 states. [2025-02-05 19:28:57,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7078 to 6232. [2025-02-05 19:28:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6232 states, 6231 states have (on average 1.4517733911089712) internal successors, (9046), 6231 states have internal predecessors, (9046), 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-02-05 19:28:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6232 states to 6232 states and 9046 transitions. [2025-02-05 19:28:57,796 INFO L78 Accepts]: Start accepts. Automaton has 6232 states and 9046 transitions. Word has length 427 [2025-02-05 19:28:57,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:28:57,796 INFO L471 AbstractCegarLoop]: Abstraction has 6232 states and 9046 transitions. [2025-02-05 19:28:57,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.16666666666667) internal successors, (427), 6 states have internal predecessors, (427), 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-02-05 19:28:57,797 INFO L276 IsEmpty]: Start isEmpty. Operand 6232 states and 9046 transitions. [2025-02-05 19:28:57,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-02-05 19:28:57,800 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:28:57,800 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:28:57,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 19:28:57,801 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:28:57,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:28:57,801 INFO L85 PathProgramCache]: Analyzing trace with hash 237510613, now seen corresponding path program 1 times [2025-02-05 19:28:57,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:28:57,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706955632] [2025-02-05 19:28:57,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:28:57,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:28:57,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-02-05 19:28:57,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-02-05 19:28:57,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:28:57,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:28:58,869 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:28:58,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:28:58,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706955632] [2025-02-05 19:28:58,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706955632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:28:58,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:28:58,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 19:28:58,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595291943] [2025-02-05 19:28:58,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:28:58,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 19:28:58,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:28:58,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 19:28:58,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 19:28:58,871 INFO L87 Difference]: Start difference. First operand 6232 states and 9046 transitions. Second operand has 8 states, 8 states have (on average 53.5) internal successors, (428), 8 states have internal predecessors, (428), 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-02-05 19:29:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:29:01,455 INFO L93 Difference]: Finished difference Result 14382 states and 20903 transitions. [2025-02-05 19:29:01,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 19:29:01,456 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 53.5) internal successors, (428), 8 states have internal predecessors, (428), 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 428 [2025-02-05 19:29:01,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:29:01,468 INFO L225 Difference]: With dead ends: 14382 [2025-02-05 19:29:01,468 INFO L226 Difference]: Without dead ends: 11000 [2025-02-05 19:29:01,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 19:29:01,474 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 2610 mSDsluCounter, 6702 mSDsCounter, 0 mSdLazyCounter, 5074 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2610 SdHoareTripleChecker+Valid, 8291 SdHoareTripleChecker+Invalid, 5075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:29:01,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2610 Valid, 8291 Invalid, 5075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5074 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 19:29:01,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11000 states. [2025-02-05 19:29:01,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11000 to 7921. [2025-02-05 19:29:01,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7921 states, 7920 states have (on average 1.4529040404040403) internal successors, (11507), 7920 states have internal predecessors, (11507), 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-02-05 19:29:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7921 states to 7921 states and 11507 transitions. [2025-02-05 19:29:01,551 INFO L78 Accepts]: Start accepts. Automaton has 7921 states and 11507 transitions. Word has length 428 [2025-02-05 19:29:01,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:29:01,551 INFO L471 AbstractCegarLoop]: Abstraction has 7921 states and 11507 transitions. [2025-02-05 19:29:01,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 53.5) internal successors, (428), 8 states have internal predecessors, (428), 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-02-05 19:29:01,552 INFO L276 IsEmpty]: Start isEmpty. Operand 7921 states and 11507 transitions. [2025-02-05 19:29:01,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-02-05 19:29:01,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:29:01,557 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:29:01,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 19:29:01,557 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:29:01,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:29:01,558 INFO L85 PathProgramCache]: Analyzing trace with hash 686787033, now seen corresponding path program 1 times [2025-02-05 19:29:01,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:29:01,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120738586] [2025-02-05 19:29:01,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:29:01,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:29:01,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-02-05 19:29:02,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-02-05 19:29:02,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:29:02,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:29:02,886 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:29:02,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:29:02,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120738586] [2025-02-05 19:29:02,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120738586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:29:02,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:29:02,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:29:02,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419229038] [2025-02-05 19:29:02,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:29:02,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:29:02,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:29:02,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:29:02,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:29:02,888 INFO L87 Difference]: Start difference. First operand 7921 states and 11507 transitions. Second operand has 6 states, 6 states have (on average 71.33333333333333) internal successors, (428), 6 states have internal predecessors, (428), 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-02-05 19:29:03,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:29:03,644 INFO L93 Difference]: Finished difference Result 16634 states and 24315 transitions. [2025-02-05 19:29:03,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:29:03,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 71.33333333333333) internal successors, (428), 6 states have internal predecessors, (428), 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 428 [2025-02-05 19:29:03,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:29:03,655 INFO L225 Difference]: With dead ends: 16634 [2025-02-05 19:29:03,656 INFO L226 Difference]: Without dead ends: 10521 [2025-02-05 19:29:03,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:29:03,663 INFO L435 NwaCegarLoop]: 1312 mSDtfsCounter, 1541 mSDsluCounter, 3487 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 4799 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 19:29:03,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1541 Valid, 4799 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 19:29:03,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10521 states. [2025-02-05 19:29:03,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10521 to 8221. [2025-02-05 19:29:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8221 states, 8220 states have (on average 1.4521897810218978) internal successors, (11937), 8220 states have internal predecessors, (11937), 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-02-05 19:29:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8221 states to 8221 states and 11937 transitions. [2025-02-05 19:29:03,737 INFO L78 Accepts]: Start accepts. Automaton has 8221 states and 11937 transitions. Word has length 428 [2025-02-05 19:29:03,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:29:03,737 INFO L471 AbstractCegarLoop]: Abstraction has 8221 states and 11937 transitions. [2025-02-05 19:29:03,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.33333333333333) internal successors, (428), 6 states have internal predecessors, (428), 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-02-05 19:29:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand 8221 states and 11937 transitions. [2025-02-05 19:29:03,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-02-05 19:29:03,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:29:03,743 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:29:03,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 19:29:03,743 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:29:03,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:29:03,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1834046966, now seen corresponding path program 1 times [2025-02-05 19:29:03,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:29:03,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549966462] [2025-02-05 19:29:03,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:29:03,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:29:03,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-02-05 19:29:04,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-02-05 19:29:04,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:29:04,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:29:04,842 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:29:04,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:29:04,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549966462] [2025-02-05 19:29:04,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549966462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:29:04,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:29:04,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:29:04,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23615052] [2025-02-05 19:29:04,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:29:04,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:29:04,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:29:04,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:29:04,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:29:04,845 INFO L87 Difference]: Start difference. First operand 8221 states and 11937 transitions. Second operand has 6 states, 6 states have (on average 71.33333333333333) internal successors, (428), 6 states have internal predecessors, (428), 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-02-05 19:29:05,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:29:05,525 INFO L93 Difference]: Finished difference Result 16849 states and 24615 transitions. [2025-02-05 19:29:05,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:29:05,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 71.33333333333333) internal successors, (428), 6 states have internal predecessors, (428), 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 428 [2025-02-05 19:29:05,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:29:05,535 INFO L225 Difference]: With dead ends: 16849 [2025-02-05 19:29:05,535 INFO L226 Difference]: Without dead ends: 10511 [2025-02-05 19:29:05,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:29:05,542 INFO L435 NwaCegarLoop]: 1219 mSDtfsCounter, 1530 mSDsluCounter, 3351 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1530 SdHoareTripleChecker+Valid, 4570 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:29:05,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1530 Valid, 4570 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:29:05,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10511 states. [2025-02-05 19:29:05,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10511 to 8221. [2025-02-05 19:29:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8221 states, 8220 states have (on average 1.4509732360097323) internal successors, (11927), 8220 states have internal predecessors, (11927), 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-02-05 19:29:05,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8221 states to 8221 states and 11927 transitions. [2025-02-05 19:29:05,619 INFO L78 Accepts]: Start accepts. Automaton has 8221 states and 11927 transitions. Word has length 428 [2025-02-05 19:29:05,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:29:05,620 INFO L471 AbstractCegarLoop]: Abstraction has 8221 states and 11927 transitions. [2025-02-05 19:29:05,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.33333333333333) internal successors, (428), 6 states have internal predecessors, (428), 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-02-05 19:29:05,620 INFO L276 IsEmpty]: Start isEmpty. Operand 8221 states and 11927 transitions. [2025-02-05 19:29:05,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-02-05 19:29:05,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:29:05,626 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:29:05,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 19:29:05,626 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:29:05,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:29:05,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1299421987, now seen corresponding path program 1 times [2025-02-05 19:29:05,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:29:05,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786489456] [2025-02-05 19:29:05,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:29:05,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:29:05,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-02-05 19:29:06,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-02-05 19:29:06,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:29:06,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:29:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:29:07,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:29:07,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786489456] [2025-02-05 19:29:07,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786489456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:29:07,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:29:07,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:29:07,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174587684] [2025-02-05 19:29:07,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:29:07,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:29:07,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:29:07,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:29:07,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:29:07,066 INFO L87 Difference]: Start difference. First operand 8221 states and 11927 transitions. Second operand has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 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-02-05 19:29:08,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:29:08,047 INFO L93 Difference]: Finished difference Result 12975 states and 18863 transitions. [2025-02-05 19:29:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:29:08,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 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 429 [2025-02-05 19:29:08,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:29:08,060 INFO L225 Difference]: With dead ends: 12975 [2025-02-05 19:29:08,060 INFO L226 Difference]: Without dead ends: 8459 [2025-02-05 19:29:08,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:29:08,066 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 1748 mSDsluCounter, 2088 mSDsCounter, 0 mSdLazyCounter, 1776 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 2913 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 19:29:08,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 2913 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1776 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 19:29:08,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8459 states. [2025-02-05 19:29:08,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8459 to 8223. [2025-02-05 19:29:08,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8223 states, 8222 states have (on average 1.4508635368523473) internal successors, (11929), 8222 states have internal predecessors, (11929), 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-02-05 19:29:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8223 states to 8223 states and 11929 transitions. [2025-02-05 19:29:08,133 INFO L78 Accepts]: Start accepts. Automaton has 8223 states and 11929 transitions. Word has length 429 [2025-02-05 19:29:08,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:29:08,133 INFO L471 AbstractCegarLoop]: Abstraction has 8223 states and 11929 transitions. [2025-02-05 19:29:08,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 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-02-05 19:29:08,133 INFO L276 IsEmpty]: Start isEmpty. Operand 8223 states and 11929 transitions. [2025-02-05 19:29:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-02-05 19:29:08,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:29:08,139 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:29:08,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 19:29:08,140 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:29:08,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:29:08,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1819380927, now seen corresponding path program 1 times [2025-02-05 19:29:08,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:29:08,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806589675] [2025-02-05 19:29:08,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:29:08,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:29:08,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-02-05 19:29:08,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-02-05 19:29:08,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:29:08,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:29:09,456 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:29:09,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:29:09,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806589675] [2025-02-05 19:29:09,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806589675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:29:09,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:29:09,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:29:09,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389288194] [2025-02-05 19:29:09,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:29:09,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:29:09,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:29:09,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:29:09,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:29:09,458 INFO L87 Difference]: Start difference. First operand 8223 states and 11929 transitions. Second operand has 6 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 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-02-05 19:29:10,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:29:10,566 INFO L93 Difference]: Finished difference Result 13445 states and 19562 transitions. [2025-02-05 19:29:10,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:29:10,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 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 430 [2025-02-05 19:29:10,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:29:10,573 INFO L225 Difference]: With dead ends: 13445 [2025-02-05 19:29:10,573 INFO L226 Difference]: Without dead ends: 8927 [2025-02-05 19:29:10,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:29:10,578 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 786 mSDsluCounter, 3082 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 3849 SdHoareTripleChecker+Invalid, 1870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:29:10,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 3849 Invalid, 1870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 19:29:10,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8927 states. [2025-02-05 19:29:10,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8927 to 8345. [2025-02-05 19:29:10,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8345 states, 8344 states have (on average 1.4507430488974113) internal successors, (12105), 8344 states have internal predecessors, (12105), 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-02-05 19:29:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8345 states to 8345 states and 12105 transitions. [2025-02-05 19:29:10,645 INFO L78 Accepts]: Start accepts. Automaton has 8345 states and 12105 transitions. Word has length 430 [2025-02-05 19:29:10,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:29:10,646 INFO L471 AbstractCegarLoop]: Abstraction has 8345 states and 12105 transitions. [2025-02-05 19:29:10,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 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-02-05 19:29:10,646 INFO L276 IsEmpty]: Start isEmpty. Operand 8345 states and 12105 transitions. [2025-02-05 19:29:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-02-05 19:29:10,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:29:10,652 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:29:10,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 19:29:10,652 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:29:10,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:29:10,654 INFO L85 PathProgramCache]: Analyzing trace with hash 948892789, now seen corresponding path program 1 times [2025-02-05 19:29:10,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:29:10,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677413010] [2025-02-05 19:29:10,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:29:10,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:29:10,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-02-05 19:29:11,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-02-05 19:29:11,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:29:11,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:29:11,921 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:29:11,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:29:11,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677413010] [2025-02-05 19:29:11,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677413010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:29:11,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:29:11,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:29:11,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221094597] [2025-02-05 19:29:11,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:29:11,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:29:11,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:29:11,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:29:11,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:29:11,923 INFO L87 Difference]: Start difference. First operand 8345 states and 12105 transitions. Second operand has 6 states, 6 states have (on average 71.83333333333333) internal successors, (431), 6 states have internal predecessors, (431), 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-02-05 19:29:12,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:29:12,746 INFO L93 Difference]: Finished difference Result 21556 states and 31279 transitions. [2025-02-05 19:29:12,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:29:12,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 71.83333333333333) internal successors, (431), 6 states have internal predecessors, (431), 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 431 [2025-02-05 19:29:12,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:29:12,762 INFO L225 Difference]: With dead ends: 21556 [2025-02-05 19:29:12,762 INFO L226 Difference]: Without dead ends: 17038 [2025-02-05 19:29:12,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:29:12,772 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 1824 mSDsluCounter, 2715 mSDsCounter, 0 mSdLazyCounter, 1424 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1824 SdHoareTripleChecker+Valid, 3496 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 19:29:12,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1824 Valid, 3496 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1424 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 19:29:12,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17038 states. [2025-02-05 19:29:12,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17038 to 16016. [2025-02-05 19:29:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16016 states, 16015 states have (on average 1.4487043396815487) internal successors, (23201), 16015 states have internal predecessors, (23201), 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-02-05 19:29:12,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16016 states to 16016 states and 23201 transitions. [2025-02-05 19:29:12,901 INFO L78 Accepts]: Start accepts. Automaton has 16016 states and 23201 transitions. Word has length 431 [2025-02-05 19:29:12,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:29:12,901 INFO L471 AbstractCegarLoop]: Abstraction has 16016 states and 23201 transitions. [2025-02-05 19:29:12,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.83333333333333) internal successors, (431), 6 states have internal predecessors, (431), 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-02-05 19:29:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 16016 states and 23201 transitions. [2025-02-05 19:29:12,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-02-05 19:29:12,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:29:12,912 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:29:12,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 19:29:12,912 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:29:12,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:29:12,913 INFO L85 PathProgramCache]: Analyzing trace with hash -161967410, now seen corresponding path program 1 times [2025-02-05 19:29:12,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:29:12,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943237728] [2025-02-05 19:29:12,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:29:12,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:29:13,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-02-05 19:29:13,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-02-05 19:29:13,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:29:13,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:29:14,293 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:29:14,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:29:14,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943237728] [2025-02-05 19:29:14,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943237728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:29:14,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:29:14,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:29:14,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937786575] [2025-02-05 19:29:14,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:29:14,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:29:14,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:29:14,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:29:14,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:29:14,295 INFO L87 Difference]: Start difference. First operand 16016 states and 23201 transitions. Second operand has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 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-02-05 19:29:15,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:29:15,337 INFO L93 Difference]: Finished difference Result 24824 states and 36023 transitions. [2025-02-05 19:29:15,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:29:15,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 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 432 [2025-02-05 19:29:15,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:29:15,351 INFO L225 Difference]: With dead ends: 24824 [2025-02-05 19:29:15,351 INFO L226 Difference]: Without dead ends: 16404 [2025-02-05 19:29:15,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:29:15,360 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 2222 mSDsluCounter, 2319 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2222 SdHoareTripleChecker+Valid, 3131 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 19:29:15,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2222 Valid, 3131 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1908 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 19:29:15,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16404 states. [2025-02-05 19:29:15,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16404 to 16020. [2025-02-05 19:29:15,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16020 states, 16019 states have (on average 1.448592296647731) internal successors, (23205), 16019 states have internal predecessors, (23205), 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-02-05 19:29:15,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16020 states to 16020 states and 23205 transitions. [2025-02-05 19:29:15,483 INFO L78 Accepts]: Start accepts. Automaton has 16020 states and 23205 transitions. Word has length 432 [2025-02-05 19:29:15,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:29:15,484 INFO L471 AbstractCegarLoop]: Abstraction has 16020 states and 23205 transitions. [2025-02-05 19:29:15,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 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-02-05 19:29:15,484 INFO L276 IsEmpty]: Start isEmpty. Operand 16020 states and 23205 transitions. [2025-02-05 19:29:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-02-05 19:29:15,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:29:15,492 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:29:15,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 19:29:15,492 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:29:15,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:29:15,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2030718979, now seen corresponding path program 1 times [2025-02-05 19:29:15,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:29:15,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100564692] [2025-02-05 19:29:15,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:29:15,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:29:15,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-02-05 19:29:16,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-02-05 19:29:16,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:29:16,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:29:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:29:16,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:29:16,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100564692] [2025-02-05 19:29:16,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100564692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:29:16,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:29:16,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:29:16,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070301473] [2025-02-05 19:29:16,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:29:16,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:29:16,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:29:16,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:29:16,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:29:16,876 INFO L87 Difference]: Start difference. First operand 16020 states and 23205 transitions. Second operand has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 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-02-05 19:29:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:29:17,662 INFO L93 Difference]: Finished difference Result 25078 states and 36395 transitions. [2025-02-05 19:29:17,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:29:17,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 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 432 [2025-02-05 19:29:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:29:17,675 INFO L225 Difference]: With dead ends: 25078 [2025-02-05 19:29:17,675 INFO L226 Difference]: Without dead ends: 16654 [2025-02-05 19:29:17,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:29:17,686 INFO L435 NwaCegarLoop]: 768 mSDtfsCounter, 1493 mSDsluCounter, 2294 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 3062 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 19:29:17,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 3062 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 19:29:17,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16654 states. [2025-02-05 19:29:17,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16654 to 16168. [2025-02-05 19:29:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16168 states, 16167 states have (on average 1.448444361971918) internal successors, (23417), 16167 states have internal predecessors, (23417), 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-02-05 19:29:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16168 states to 16168 states and 23417 transitions. [2025-02-05 19:29:17,805 INFO L78 Accepts]: Start accepts. Automaton has 16168 states and 23417 transitions. Word has length 432 [2025-02-05 19:29:17,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:29:17,807 INFO L471 AbstractCegarLoop]: Abstraction has 16168 states and 23417 transitions. [2025-02-05 19:29:17,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 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-02-05 19:29:17,808 INFO L276 IsEmpty]: Start isEmpty. Operand 16168 states and 23417 transitions. [2025-02-05 19:29:17,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-02-05 19:29:17,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:29:17,816 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:29:17,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 19:29:17,817 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:29:17,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:29:17,817 INFO L85 PathProgramCache]: Analyzing trace with hash -958914673, now seen corresponding path program 1 times [2025-02-05 19:29:17,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:29:17,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529793921] [2025-02-05 19:29:17,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:29:17,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:29:17,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-02-05 19:29:18,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-02-05 19:29:18,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:29:18,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat