./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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.vis_QF_BV_s1269b_p2.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 895ff1e019ffafaf8b2f8e3efbd16ea4845b2e4eac0a4db8b4c86c462883ae8c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:11:34,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:11:34,374 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:11:34,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:11:34,381 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:11:34,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:11:34,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:11:34,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:11:34,404 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:11:34,404 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:11:34,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:11:34,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:11:34,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:11:34,405 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:11:34,405 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:11:34,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:11:34,406 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:11:34,406 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:11:34,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:11:34,406 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:11:34,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:11:34,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:11:34,406 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:11:34,406 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:11:34,407 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:11:34,407 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:11:34,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:11:34,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:11:34,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:11:34,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:11:34,407 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:11:34,407 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:11:34,408 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:11:34,408 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:11:34,408 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:11:34,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:11:34,408 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:11:34,408 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:11:34,408 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:11:34,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:11:34,408 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 -> 895ff1e019ffafaf8b2f8e3efbd16ea4845b2e4eac0a4db8b4c86c462883ae8c [2025-02-08 00:11:34,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:11:34,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:11:34,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:11:34,693 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:11:34,693 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:11:34,694 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.vis_QF_BV_s1269b_p2.c [2025-02-08 00:11:35,902 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c14719c08/b34fb7cf44aa448aa82a64840889e5ba/FLAGa0e53f1c4 [2025-02-08 00:11:36,187 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:11:36,188 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2025-02-08 00:11:36,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c14719c08/b34fb7cf44aa448aa82a64840889e5ba/FLAGa0e53f1c4 [2025-02-08 00:11:36,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c14719c08/b34fb7cf44aa448aa82a64840889e5ba [2025-02-08 00:11:36,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:11:36,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:11:36,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:11:36,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:11:36,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:11:36,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:11:36" (1/1) ... [2025-02-08 00:11:36,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@537c6340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:36, skipping insertion in model container [2025-02-08 00:11:36,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:11:36" (1/1) ... [2025-02-08 00:11:36,250 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:11:36,362 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.vis_QF_BV_s1269b_p2.c[1259,1272] [2025-02-08 00:11:36,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:11:36,430 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:11:36,437 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.vis_QF_BV_s1269b_p2.c[1259,1272] [2025-02-08 00:11:36,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:11:36,491 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:11:36,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:36 WrapperNode [2025-02-08 00:11:36,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:11:36,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:11:36,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:11:36,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:11:36,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:36" (1/1) ... [2025-02-08 00:11:36,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:36" (1/1) ... [2025-02-08 00:11:36,560 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 483 [2025-02-08 00:11:36,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:11:36,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:11:36,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:11:36,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:11:36,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:36" (1/1) ... [2025-02-08 00:11:36,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:36" (1/1) ... [2025-02-08 00:11:36,582 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:36" (1/1) ... [2025-02-08 00:11:36,615 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-08 00:11:36,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:36" (1/1) ... [2025-02-08 00:11:36,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:36" (1/1) ... [2025-02-08 00:11:36,638 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:36" (1/1) ... [2025-02-08 00:11:36,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:36" (1/1) ... [2025-02-08 00:11:36,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:36" (1/1) ... [2025-02-08 00:11:36,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:36" (1/1) ... [2025-02-08 00:11:36,674 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:11:36,675 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:11:36,676 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:11:36,676 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:11:36,676 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:36" (1/1) ... [2025-02-08 00:11:36,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:11:36,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:11:36,704 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-08 00:11:36,707 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-08 00:11:36,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:11:36,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:11:36,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:11:36,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:11:36,829 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:11:36,831 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:11:37,399 INFO L? ?]: Removed 249 outVars from TransFormulas that were not future-live. [2025-02-08 00:11:37,400 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:11:37,439 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:11:37,442 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:11:37,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:11:37 BoogieIcfgContainer [2025-02-08 00:11:37,442 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:11:37,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:11:37,445 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:11:37,449 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:11:37,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:11:36" (1/3) ... [2025-02-08 00:11:37,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0f87ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:11:37, skipping insertion in model container [2025-02-08 00:11:37,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:36" (2/3) ... [2025-02-08 00:11:37,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0f87ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:11:37, skipping insertion in model container [2025-02-08 00:11:37,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:11:37" (3/3) ... [2025-02-08 00:11:37,452 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2025-02-08 00:11:37,468 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:11:37,469 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p2.c that has 1 procedures, 124 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:11:37,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:11:37,535 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;@8dbb3de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:11:37,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:11:37,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 122 states have (on average 1.5) internal successors, (183), 123 states have internal predecessors, (183), 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-08 00:11:37,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 00:11:37,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:37,545 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] [2025-02-08 00:11:37,545 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:37,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:37,551 INFO L85 PathProgramCache]: Analyzing trace with hash -359729534, now seen corresponding path program 1 times [2025-02-08 00:11:37,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:37,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716985694] [2025-02-08 00:11:37,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:37,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:37,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 00:11:37,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 00:11:37,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:37,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:37,986 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-08 00:11:37,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:37,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716985694] [2025-02-08 00:11:37,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716985694] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:37,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:37,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:11:37,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755110268] [2025-02-08 00:11:37,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:37,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:11:37,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:38,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:11:38,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:11:38,016 INFO L87 Difference]: Start difference. First operand has 124 states, 122 states have (on average 1.5) internal successors, (183), 123 states have internal predecessors, (183), 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 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-08 00:11:38,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:38,146 INFO L93 Difference]: Finished difference Result 231 states and 343 transitions. [2025-02-08 00:11:38,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:11:38,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2025-02-08 00:11:38,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:38,156 INFO L225 Difference]: With dead ends: 231 [2025-02-08 00:11:38,156 INFO L226 Difference]: Without dead ends: 124 [2025-02-08 00:11:38,159 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-08 00:11:38,162 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:38,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:11:38,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-08 00:11:38,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-02-08 00:11:38,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.4796747967479675) internal successors, (182), 123 states have internal predecessors, (182), 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-08 00:11:38,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2025-02-08 00:11:38,196 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 182 transitions. Word has length 22 [2025-02-08 00:11:38,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:38,197 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 182 transitions. [2025-02-08 00:11:38,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-08 00:11:38,197 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 182 transitions. [2025-02-08 00:11:38,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 00:11:38,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:38,198 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] [2025-02-08 00:11:38,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:11:38,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:38,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:38,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1737965617, now seen corresponding path program 1 times [2025-02-08 00:11:38,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:38,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961757481] [2025-02-08 00:11:38,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:38,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:38,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 00:11:38,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 00:11:38,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:38,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:38,343 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-08 00:11:38,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:38,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961757481] [2025-02-08 00:11:38,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961757481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:38,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:38,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:11:38,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920294886] [2025-02-08 00:11:38,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:38,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:11:38,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:38,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:11:38,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:11:38,345 INFO L87 Difference]: Start difference. First operand 124 states and 182 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-08 00:11:38,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:38,440 INFO L93 Difference]: Finished difference Result 233 states and 342 transitions. [2025-02-08 00:11:38,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:11:38,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2025-02-08 00:11:38,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:38,442 INFO L225 Difference]: With dead ends: 233 [2025-02-08 00:11:38,444 INFO L226 Difference]: Without dead ends: 126 [2025-02-08 00:11:38,444 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-08 00:11:38,445 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:38,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 439 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:11:38,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-08 00:11:38,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-02-08 00:11:38,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.472) internal successors, (184), 125 states have internal predecessors, (184), 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-08 00:11:38,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 184 transitions. [2025-02-08 00:11:38,455 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 184 transitions. Word has length 23 [2025-02-08 00:11:38,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:38,455 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 184 transitions. [2025-02-08 00:11:38,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-08 00:11:38,455 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 184 transitions. [2025-02-08 00:11:38,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 00:11:38,456 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:38,456 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] [2025-02-08 00:11:38,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:11:38,456 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:38,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:38,457 INFO L85 PathProgramCache]: Analyzing trace with hash -26131363, now seen corresponding path program 1 times [2025-02-08 00:11:38,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:38,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794133250] [2025-02-08 00:11:38,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:38,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:38,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 00:11:38,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 00:11:38,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:38,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:38,899 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-08 00:11:38,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:38,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794133250] [2025-02-08 00:11:38,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794133250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:38,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:38,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:11:38,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101044369] [2025-02-08 00:11:38,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:38,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:11:38,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:38,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:11:38,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:11:38,902 INFO L87 Difference]: Start difference. First operand 126 states and 184 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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-08 00:11:39,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:39,174 INFO L93 Difference]: Finished difference Result 329 states and 480 transitions. [2025-02-08 00:11:39,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:11:39,174 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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 24 [2025-02-08 00:11:39,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:39,176 INFO L225 Difference]: With dead ends: 329 [2025-02-08 00:11:39,176 INFO L226 Difference]: Without dead ends: 220 [2025-02-08 00:11:39,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-08 00:11:39,177 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 147 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:39,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1048 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:11:39,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-08 00:11:39,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 138. [2025-02-08 00:11:39,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.467153284671533) internal successors, (201), 137 states have internal predecessors, (201), 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-08 00:11:39,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 201 transitions. [2025-02-08 00:11:39,189 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 201 transitions. Word has length 24 [2025-02-08 00:11:39,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:39,189 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 201 transitions. [2025-02-08 00:11:39,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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-08 00:11:39,191 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 201 transitions. [2025-02-08 00:11:39,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 00:11:39,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:39,192 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] [2025-02-08 00:11:39,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:11:39,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:39,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:39,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1730997061, now seen corresponding path program 1 times [2025-02-08 00:11:39,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:39,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630039559] [2025-02-08 00:11:39,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:39,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:39,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 00:11:39,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 00:11:39,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:39,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:39,374 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-08 00:11:39,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:39,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630039559] [2025-02-08 00:11:39,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630039559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:39,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:39,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:11:39,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981661497] [2025-02-08 00:11:39,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:39,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:11:39,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:39,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:11:39,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:11:39,376 INFO L87 Difference]: Start difference. First operand 138 states and 201 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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-08 00:11:39,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:39,569 INFO L93 Difference]: Finished difference Result 318 states and 461 transitions. [2025-02-08 00:11:39,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:11:39,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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 25 [2025-02-08 00:11:39,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:39,571 INFO L225 Difference]: With dead ends: 318 [2025-02-08 00:11:39,571 INFO L226 Difference]: Without dead ends: 200 [2025-02-08 00:11:39,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:11:39,572 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 109 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:39,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 809 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:11:39,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-08 00:11:39,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 139. [2025-02-08 00:11:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.4565217391304348) internal successors, (201), 138 states have internal predecessors, (201), 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-08 00:11:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 201 transitions. [2025-02-08 00:11:39,581 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 201 transitions. Word has length 25 [2025-02-08 00:11:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:39,581 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 201 transitions. [2025-02-08 00:11:39,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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-08 00:11:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 201 transitions. [2025-02-08 00:11:39,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 00:11:39,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:39,582 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] [2025-02-08 00:11:39,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:11:39,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:39,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:39,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1503018264, now seen corresponding path program 1 times [2025-02-08 00:11:39,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:39,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876151723] [2025-02-08 00:11:39,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:39,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:39,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 00:11:39,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 00:11:39,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:39,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:39,671 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-08 00:11:39,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:39,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876151723] [2025-02-08 00:11:39,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876151723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:39,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:39,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:11:39,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90768806] [2025-02-08 00:11:39,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:39,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:11:39,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:39,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:11:39,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:11:39,673 INFO L87 Difference]: Start difference. First operand 139 states and 201 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-08 00:11:39,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:39,771 INFO L93 Difference]: Finished difference Result 323 states and 467 transitions. [2025-02-08 00:11:39,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:11:39,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2025-02-08 00:11:39,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:39,772 INFO L225 Difference]: With dead ends: 323 [2025-02-08 00:11:39,773 INFO L226 Difference]: Without dead ends: 205 [2025-02-08 00:11:39,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-08 00:11:39,774 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 120 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:39,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 555 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:11:39,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-08 00:11:39,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 135. [2025-02-08 00:11:39,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.455223880597015) internal successors, (195), 134 states have internal predecessors, (195), 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-08 00:11:39,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 195 transitions. [2025-02-08 00:11:39,779 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 195 transitions. Word has length 26 [2025-02-08 00:11:39,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:39,779 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 195 transitions. [2025-02-08 00:11:39,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-08 00:11:39,779 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 195 transitions. [2025-02-08 00:11:39,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 00:11:39,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:39,780 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] [2025-02-08 00:11:39,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:11:39,780 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:39,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:39,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1206022190, now seen corresponding path program 1 times [2025-02-08 00:11:39,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:39,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171709154] [2025-02-08 00:11:39,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:39,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:39,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 00:11:39,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 00:11:39,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:39,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:40,154 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-08 00:11:40,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:40,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171709154] [2025-02-08 00:11:40,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171709154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:40,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:40,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 00:11:40,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950210532] [2025-02-08 00:11:40,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:40,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 00:11:40,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:40,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 00:11:40,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:11:40,155 INFO L87 Difference]: Start difference. First operand 135 states and 195 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 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-08 00:11:40,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:40,519 INFO L93 Difference]: Finished difference Result 324 states and 468 transitions. [2025-02-08 00:11:40,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 00:11:40,519 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 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 26 [2025-02-08 00:11:40,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:40,520 INFO L225 Difference]: With dead ends: 324 [2025-02-08 00:11:40,520 INFO L226 Difference]: Without dead ends: 215 [2025-02-08 00:11:40,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-02-08 00:11:40,522 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 132 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:40,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1316 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:11:40,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-02-08 00:11:40,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 139. [2025-02-08 00:11:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.4492753623188406) internal successors, (200), 138 states have internal predecessors, (200), 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-08 00:11:40,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 200 transitions. [2025-02-08 00:11:40,530 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 200 transitions. Word has length 26 [2025-02-08 00:11:40,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:40,531 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 200 transitions. [2025-02-08 00:11:40,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 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-08 00:11:40,531 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 200 transitions. [2025-02-08 00:11:40,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 00:11:40,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:40,532 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] [2025-02-08 00:11:40,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:11:40,533 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:40,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:40,533 INFO L85 PathProgramCache]: Analyzing trace with hash 822118307, now seen corresponding path program 1 times [2025-02-08 00:11:40,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:40,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807951875] [2025-02-08 00:11:40,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:40,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:40,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 00:11:40,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 00:11:40,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:40,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:40,919 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-08 00:11:40,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:40,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807951875] [2025-02-08 00:11:40,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807951875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:40,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:40,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:11:40,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510641746] [2025-02-08 00:11:40,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:40,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:11:40,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:40,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:11:40,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:11:40,921 INFO L87 Difference]: Start difference. First operand 139 states and 200 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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-08 00:11:41,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:41,129 INFO L93 Difference]: Finished difference Result 250 states and 361 transitions. [2025-02-08 00:11:41,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:11:41,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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 27 [2025-02-08 00:11:41,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:41,130 INFO L225 Difference]: With dead ends: 250 [2025-02-08 00:11:41,130 INFO L226 Difference]: Without dead ends: 134 [2025-02-08 00:11:41,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:11:41,131 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 20 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:41,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1094 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:11:41,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-08 00:11:41,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-02-08 00:11:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.443609022556391) internal successors, (192), 133 states have internal predecessors, (192), 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-08 00:11:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 192 transitions. [2025-02-08 00:11:41,135 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 192 transitions. Word has length 27 [2025-02-08 00:11:41,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:41,135 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 192 transitions. [2025-02-08 00:11:41,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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-08 00:11:41,136 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 192 transitions. [2025-02-08 00:11:41,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-08 00:11:41,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:41,137 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:11:41,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:11:41,137 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:41,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:41,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1808609153, now seen corresponding path program 1 times [2025-02-08 00:11:41,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:41,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383741651] [2025-02-08 00:11:41,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:41,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:41,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-08 00:11:41,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 00:11:41,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:41,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:41,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:41,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383741651] [2025-02-08 00:11:41,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383741651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:41,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:41,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:11:41,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755870944] [2025-02-08 00:11:41,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:41,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:11:41,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:41,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:11:41,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:11:41,454 INFO L87 Difference]: Start difference. First operand 134 states and 192 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 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-08 00:11:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:41,602 INFO L93 Difference]: Finished difference Result 303 states and 439 transitions. [2025-02-08 00:11:41,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:11:41,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 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 77 [2025-02-08 00:11:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:41,603 INFO L225 Difference]: With dead ends: 303 [2025-02-08 00:11:41,603 INFO L226 Difference]: Without dead ends: 194 [2025-02-08 00:11:41,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:11:41,604 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 110 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:41,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 829 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:11:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-08 00:11:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 151. [2025-02-08 00:11:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.4266666666666667) internal successors, (214), 150 states have internal predecessors, (214), 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-08 00:11:41,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 214 transitions. [2025-02-08 00:11:41,614 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 214 transitions. Word has length 77 [2025-02-08 00:11:41,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:41,614 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 214 transitions. [2025-02-08 00:11:41,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 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-08 00:11:41,614 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 214 transitions. [2025-02-08 00:11:41,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-08 00:11:41,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:41,615 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:11:41,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:11:41,615 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:41,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:41,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1509591201, now seen corresponding path program 1 times [2025-02-08 00:11:41,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:41,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311794631] [2025-02-08 00:11:41,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:41,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:41,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 00:11:41,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 00:11:41,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:41,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:42,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:42,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:42,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311794631] [2025-02-08 00:11:42,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311794631] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:11:42,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123435994] [2025-02-08 00:11:42,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:42,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:11:42,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:11:42,086 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-08 00:11:42,088 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-08 00:11:42,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 00:11:42,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 00:11:42,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:42,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:42,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-08 00:11:42,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:11:42,423 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:42,425 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:11:42,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123435994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:42,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 00:11:42,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 16 [2025-02-08 00:11:42,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902236324] [2025-02-08 00:11:42,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:42,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:11:42,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:42,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:11:42,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-02-08 00:11:42,428 INFO L87 Difference]: Start difference. First operand 151 states and 214 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 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-08 00:11:42,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:42,656 INFO L93 Difference]: Finished difference Result 319 states and 461 transitions. [2025-02-08 00:11:42,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:11:42,656 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 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 78 [2025-02-08 00:11:42,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:42,657 INFO L225 Difference]: With dead ends: 319 [2025-02-08 00:11:42,657 INFO L226 Difference]: Without dead ends: 210 [2025-02-08 00:11:42,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2025-02-08 00:11:42,659 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 111 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:42,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 930 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:11:42,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-08 00:11:42,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 169. [2025-02-08 00:11:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.4226190476190477) internal successors, (239), 168 states have internal predecessors, (239), 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-08 00:11:42,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 239 transitions. [2025-02-08 00:11:42,663 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 239 transitions. Word has length 78 [2025-02-08 00:11:42,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:42,663 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 239 transitions. [2025-02-08 00:11:42,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 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-08 00:11:42,664 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 239 transitions. [2025-02-08 00:11:42,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 00:11:42,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:42,665 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:11:42,673 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-08 00:11:42,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:11:42,869 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:42,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:42,870 INFO L85 PathProgramCache]: Analyzing trace with hash -193764914, now seen corresponding path program 1 times [2025-02-08 00:11:42,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:42,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194061485] [2025-02-08 00:11:42,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:42,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:42,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 00:11:42,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 00:11:42,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:42,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:43,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:43,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194061485] [2025-02-08 00:11:43,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194061485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:43,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:43,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:11:43,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463203649] [2025-02-08 00:11:43,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:43,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:11:43,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:43,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:11:43,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:11:43,036 INFO L87 Difference]: Start difference. First operand 169 states and 239 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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-08 00:11:43,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:43,133 INFO L93 Difference]: Finished difference Result 294 states and 421 transitions. [2025-02-08 00:11:43,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:11:43,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-08 00:11:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:43,134 INFO L225 Difference]: With dead ends: 294 [2025-02-08 00:11:43,134 INFO L226 Difference]: Without dead ends: 185 [2025-02-08 00:11:43,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-08 00:11:43,135 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 58 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:43,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 546 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:11:43,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-08 00:11:43,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2025-02-08 00:11:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.409356725146199) internal successors, (241), 171 states have internal predecessors, (241), 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-08 00:11:43,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 241 transitions. [2025-02-08 00:11:43,139 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 241 transitions. Word has length 79 [2025-02-08 00:11:43,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:43,139 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 241 transitions. [2025-02-08 00:11:43,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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-08 00:11:43,139 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 241 transitions. [2025-02-08 00:11:43,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 00:11:43,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:43,140 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:11:43,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 00:11:43,140 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:43,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:43,141 INFO L85 PathProgramCache]: Analyzing trace with hash -527602861, now seen corresponding path program 1 times [2025-02-08 00:11:43,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:43,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641169213] [2025-02-08 00:11:43,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:43,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:43,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 00:11:43,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 00:11:43,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:43,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:44,458 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:44,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:44,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641169213] [2025-02-08 00:11:44,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641169213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:44,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:44,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-08 00:11:44,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077376659] [2025-02-08 00:11:44,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:44,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 00:11:44,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:44,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 00:11:44,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-02-08 00:11:44,459 INFO L87 Difference]: Start difference. First operand 172 states and 241 transitions. Second operand has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 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-08 00:11:44,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:44,905 INFO L93 Difference]: Finished difference Result 357 states and 513 transitions. [2025-02-08 00:11:44,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 00:11:44,905 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-08 00:11:44,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:44,906 INFO L225 Difference]: With dead ends: 357 [2025-02-08 00:11:44,907 INFO L226 Difference]: Without dead ends: 248 [2025-02-08 00:11:44,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-02-08 00:11:44,907 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 149 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:44,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1358 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:11:44,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-02-08 00:11:44,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 216. [2025-02-08 00:11:44,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.4232558139534883) internal successors, (306), 215 states have internal predecessors, (306), 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-08 00:11:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 306 transitions. [2025-02-08 00:11:44,912 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 306 transitions. Word has length 79 [2025-02-08 00:11:44,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:44,913 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 306 transitions. [2025-02-08 00:11:44,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 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-08 00:11:44,913 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 306 transitions. [2025-02-08 00:11:44,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-08 00:11:44,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:44,916 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:11:44,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 00:11:44,917 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:44,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:44,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1360171544, now seen corresponding path program 1 times [2025-02-08 00:11:44,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:44,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046833257] [2025-02-08 00:11:44,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:44,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:44,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 00:11:45,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 00:11:45,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:45,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:45,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:45,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046833257] [2025-02-08 00:11:45,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046833257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:45,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:45,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 00:11:45,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017279198] [2025-02-08 00:11:45,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:45,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 00:11:45,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:45,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 00:11:45,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:11:45,635 INFO L87 Difference]: Start difference. First operand 216 states and 306 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 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-08 00:11:45,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:45,998 INFO L93 Difference]: Finished difference Result 391 states and 561 transitions. [2025-02-08 00:11:45,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 00:11:45,999 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 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 80 [2025-02-08 00:11:45,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:46,000 INFO L225 Difference]: With dead ends: 391 [2025-02-08 00:11:46,000 INFO L226 Difference]: Without dead ends: 262 [2025-02-08 00:11:46,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-02-08 00:11:46,001 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 159 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:46,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 951 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:11:46,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-02-08 00:11:46,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 229. [2025-02-08 00:11:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.4210526315789473) internal successors, (324), 228 states have internal predecessors, (324), 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-08 00:11:46,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 324 transitions. [2025-02-08 00:11:46,008 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 324 transitions. Word has length 80 [2025-02-08 00:11:46,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:46,009 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 324 transitions. [2025-02-08 00:11:46,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 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-08 00:11:46,009 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 324 transitions. [2025-02-08 00:11:46,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-08 00:11:46,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:46,010 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:11:46,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 00:11:46,011 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:46,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:46,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1050576186, now seen corresponding path program 1 times [2025-02-08 00:11:46,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:46,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422652365] [2025-02-08 00:11:46,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:46,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:46,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 00:11:46,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 00:11:46,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:46,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:46,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:46,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422652365] [2025-02-08 00:11:46,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422652365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:46,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:46,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:11:46,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613507018] [2025-02-08 00:11:46,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:46,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:11:46,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:46,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:11:46,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:11:46,380 INFO L87 Difference]: Start difference. First operand 229 states and 324 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 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-08 00:11:46,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:46,557 INFO L93 Difference]: Finished difference Result 397 states and 569 transitions. [2025-02-08 00:11:46,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:11:46,558 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 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 80 [2025-02-08 00:11:46,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:46,559 INFO L225 Difference]: With dead ends: 397 [2025-02-08 00:11:46,559 INFO L226 Difference]: Without dead ends: 248 [2025-02-08 00:11:46,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:11:46,560 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 51 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:46,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1045 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:11:46,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-02-08 00:11:46,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2025-02-08 00:11:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.4008097165991902) internal successors, (346), 247 states have internal predecessors, (346), 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-08 00:11:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 346 transitions. [2025-02-08 00:11:46,568 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 346 transitions. Word has length 80 [2025-02-08 00:11:46,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:46,568 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 346 transitions. [2025-02-08 00:11:46,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 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-08 00:11:46,568 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 346 transitions. [2025-02-08 00:11:46,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-08 00:11:46,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:46,571 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:11:46,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 00:11:46,571 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:46,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:46,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1075592667, now seen corresponding path program 1 times [2025-02-08 00:11:46,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:46,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996592463] [2025-02-08 00:11:46,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:46,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:46,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 00:11:46,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 00:11:46,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:46,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:47,061 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:47,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:47,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996592463] [2025-02-08 00:11:47,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996592463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:47,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:47,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 00:11:47,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998100697] [2025-02-08 00:11:47,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:47,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 00:11:47,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:47,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 00:11:47,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:11:47,064 INFO L87 Difference]: Start difference. First operand 248 states and 346 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 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-08 00:11:47,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:47,326 INFO L93 Difference]: Finished difference Result 423 states and 601 transitions. [2025-02-08 00:11:47,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 00:11:47,326 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 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 81 [2025-02-08 00:11:47,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:47,327 INFO L225 Difference]: With dead ends: 423 [2025-02-08 00:11:47,328 INFO L226 Difference]: Without dead ends: 314 [2025-02-08 00:11:47,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-02-08 00:11:47,328 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 43 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:47,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1400 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:11:47,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-02-08 00:11:47,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 304. [2025-02-08 00:11:47,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.4059405940594059) internal successors, (426), 303 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-08 00:11:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 426 transitions. [2025-02-08 00:11:47,342 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 426 transitions. Word has length 81 [2025-02-08 00:11:47,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:47,342 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 426 transitions. [2025-02-08 00:11:47,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 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-08 00:11:47,343 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 426 transitions. [2025-02-08 00:11:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-08 00:11:47,343 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:47,343 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:11:47,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 00:11:47,343 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:47,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:47,344 INFO L85 PathProgramCache]: Analyzing trace with hash -702741822, now seen corresponding path program 1 times [2025-02-08 00:11:47,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:47,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212110576] [2025-02-08 00:11:47,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:47,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:47,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 00:11:47,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 00:11:47,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:47,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:48,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:48,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212110576] [2025-02-08 00:11:48,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212110576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:48,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:48,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-08 00:11:48,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073617037] [2025-02-08 00:11:48,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:48,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 00:11:48,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:48,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 00:11:48,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-02-08 00:11:48,190 INFO L87 Difference]: Start difference. First operand 304 states and 426 transitions. Second operand has 16 states, 16 states have (on average 5.0625) internal successors, (81), 15 states have internal predecessors, (81), 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-08 00:11:48,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:48,653 INFO L93 Difference]: Finished difference Result 507 states and 719 transitions. [2025-02-08 00:11:48,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 00:11:48,653 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 15 states have internal predecessors, (81), 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 81 [2025-02-08 00:11:48,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:48,655 INFO L225 Difference]: With dead ends: 507 [2025-02-08 00:11:48,655 INFO L226 Difference]: Without dead ends: 362 [2025-02-08 00:11:48,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-02-08 00:11:48,657 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 71 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:48,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1701 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:11:48,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-02-08 00:11:48,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 348. [2025-02-08 00:11:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 1.4034582132564841) internal successors, (487), 347 states have internal predecessors, (487), 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-08 00:11:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 487 transitions. [2025-02-08 00:11:48,666 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 487 transitions. Word has length 81 [2025-02-08 00:11:48,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:48,666 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 487 transitions. [2025-02-08 00:11:48,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 15 states have internal predecessors, (81), 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-08 00:11:48,667 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 487 transitions. [2025-02-08 00:11:48,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-08 00:11:48,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:48,668 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:11:48,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 00:11:48,668 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:48,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:48,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1991116483, now seen corresponding path program 1 times [2025-02-08 00:11:48,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:48,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954699317] [2025-02-08 00:11:48,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:48,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:48,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 00:11:48,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 00:11:48,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:48,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:48,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:48,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954699317] [2025-02-08 00:11:48,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954699317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:48,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:48,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:11:48,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290693373] [2025-02-08 00:11:48,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:48,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:11:48,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:48,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:11:48,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:11:48,864 INFO L87 Difference]: Start difference. First operand 348 states and 487 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-08 00:11:48,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:48,950 INFO L93 Difference]: Finished difference Result 545 states and 770 transitions. [2025-02-08 00:11:48,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:11:48,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2025-02-08 00:11:48,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:48,951 INFO L225 Difference]: With dead ends: 545 [2025-02-08 00:11:48,951 INFO L226 Difference]: Without dead ends: 341 [2025-02-08 00:11:48,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-08 00:11:48,952 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 61 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:48,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 555 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:11:48,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-02-08 00:11:48,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 335. [2025-02-08 00:11:48,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.3892215568862276) internal successors, (464), 334 states have internal predecessors, (464), 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-08 00:11:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 464 transitions. [2025-02-08 00:11:48,961 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 464 transitions. Word has length 81 [2025-02-08 00:11:48,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:48,961 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 464 transitions. [2025-02-08 00:11:48,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-08 00:11:48,962 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 464 transitions. [2025-02-08 00:11:48,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-08 00:11:48,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:48,964 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:11:48,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 00:11:48,965 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:48,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:48,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1390238962, now seen corresponding path program 1 times [2025-02-08 00:11:48,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:48,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178502206] [2025-02-08 00:11:48,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:48,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:48,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 00:11:49,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 00:11:49,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:49,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:49,288 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:49,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:49,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178502206] [2025-02-08 00:11:49,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178502206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:49,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:49,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 00:11:49,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846701263] [2025-02-08 00:11:49,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:49,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 00:11:49,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:49,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 00:11:49,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:11:49,291 INFO L87 Difference]: Start difference. First operand 335 states and 464 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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-08 00:11:49,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:49,581 INFO L93 Difference]: Finished difference Result 589 states and 833 transitions. [2025-02-08 00:11:49,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 00:11:49,581 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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 82 [2025-02-08 00:11:49,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:49,583 INFO L225 Difference]: With dead ends: 589 [2025-02-08 00:11:49,583 INFO L226 Difference]: Without dead ends: 444 [2025-02-08 00:11:49,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-02-08 00:11:49,584 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 168 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:49,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1835 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:11:49,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-02-08 00:11:49,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 352. [2025-02-08 00:11:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 1.3903133903133904) internal successors, (488), 351 states have internal predecessors, (488), 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-08 00:11:49,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 488 transitions. [2025-02-08 00:11:49,593 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 488 transitions. Word has length 82 [2025-02-08 00:11:49,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:49,593 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 488 transitions. [2025-02-08 00:11:49,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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-08 00:11:49,594 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 488 transitions. [2025-02-08 00:11:49,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-08 00:11:49,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:49,595 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:11:49,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 00:11:49,596 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:49,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:49,596 INFO L85 PathProgramCache]: Analyzing trace with hash 95440883, now seen corresponding path program 1 times [2025-02-08 00:11:49,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:49,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803811409] [2025-02-08 00:11:49,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:49,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:49,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 00:11:49,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 00:11:49,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:49,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:49,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:49,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803811409] [2025-02-08 00:11:49,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803811409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:49,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:49,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 00:11:49,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043907783] [2025-02-08 00:11:49,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:49,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 00:11:49,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:49,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 00:11:49,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:11:49,945 INFO L87 Difference]: Start difference. First operand 352 states and 488 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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-08 00:11:50,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:50,282 INFO L93 Difference]: Finished difference Result 828 states and 1167 transitions. [2025-02-08 00:11:50,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 00:11:50,282 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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 82 [2025-02-08 00:11:50,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:50,284 INFO L225 Difference]: With dead ends: 828 [2025-02-08 00:11:50,284 INFO L226 Difference]: Without dead ends: 666 [2025-02-08 00:11:50,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-02-08 00:11:50,285 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 148 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:50,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1706 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:11:50,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-02-08 00:11:50,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 575. [2025-02-08 00:11:50,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 574 states have (on average 1.3885017421602788) internal successors, (797), 574 states have internal predecessors, (797), 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-08 00:11:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 797 transitions. [2025-02-08 00:11:50,297 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 797 transitions. Word has length 82 [2025-02-08 00:11:50,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:50,297 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 797 transitions. [2025-02-08 00:11:50,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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-08 00:11:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 797 transitions. [2025-02-08 00:11:50,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-08 00:11:50,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:50,299 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:50,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 00:11:50,299 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:50,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:50,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1517514061, now seen corresponding path program 1 times [2025-02-08 00:11:50,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:50,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987114084] [2025-02-08 00:11:50,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:50,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:50,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 00:11:50,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 00:11:50,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:50,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:50,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:50,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:50,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987114084] [2025-02-08 00:11:50,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987114084] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:11:50,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262720294] [2025-02-08 00:11:50,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:50,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:11:50,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:11:50,787 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-08 00:11:50,789 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-08 00:11:50,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 00:11:50,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 00:11:50,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:50,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:50,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-02-08 00:11:50,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:11:51,620 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:51,621 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:11:51,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262720294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:51,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 00:11:51,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [13] total 29 [2025-02-08 00:11:51,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629145568] [2025-02-08 00:11:51,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:51,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 00:11:51,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:51,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 00:11:51,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2025-02-08 00:11:51,624 INFO L87 Difference]: Start difference. First operand 575 states and 797 transitions. Second operand has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 17 states have internal predecessors, (82), 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-08 00:11:52,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:52,268 INFO L93 Difference]: Finished difference Result 1033 states and 1450 transitions. [2025-02-08 00:11:52,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 00:11:52,269 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 17 states have internal predecessors, (82), 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 82 [2025-02-08 00:11:52,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:52,271 INFO L225 Difference]: With dead ends: 1033 [2025-02-08 00:11:52,271 INFO L226 Difference]: Without dead ends: 629 [2025-02-08 00:11:52,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=1553, Unknown=0, NotChecked=0, Total=1722 [2025-02-08 00:11:52,273 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 199 mSDsluCounter, 1645 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:52,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1799 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:11:52,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-02-08 00:11:52,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 577. [2025-02-08 00:11:52,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 1.3836805555555556) internal successors, (797), 576 states have internal predecessors, (797), 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-08 00:11:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 797 transitions. [2025-02-08 00:11:52,285 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 797 transitions. Word has length 82 [2025-02-08 00:11:52,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:52,285 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 797 transitions. [2025-02-08 00:11:52,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 17 states have internal predecessors, (82), 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-08 00:11:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 797 transitions. [2025-02-08 00:11:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 00:11:52,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:52,287 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:11:52,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 00:11:52,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:11:52,487 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:52,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:52,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2006947616, now seen corresponding path program 1 times [2025-02-08 00:11:52,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:52,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753179233] [2025-02-08 00:11:52,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:52,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:52,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 00:11:52,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 00:11:52,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:52,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:52,976 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:52,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:52,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753179233] [2025-02-08 00:11:52,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753179233] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:11:52,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268751520] [2025-02-08 00:11:52,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:52,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:11:52,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:11:52,979 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-08 00:11:52,981 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-08 00:11:53,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 00:11:53,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 00:11:53,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:53,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:53,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-02-08 00:11:53,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:11:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:53,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:11:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:54,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268751520] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:11:54,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:11:54,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 46 [2025-02-08 00:11:54,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932137643] [2025-02-08 00:11:54,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:11:54,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-08 00:11:54,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:54,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-08 00:11:54,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2031, Unknown=0, NotChecked=0, Total=2162 [2025-02-08 00:11:54,762 INFO L87 Difference]: Start difference. First operand 577 states and 797 transitions. Second operand has 47 states, 47 states have (on average 5.042553191489362) internal successors, (237), 46 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:57,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:57,841 INFO L93 Difference]: Finished difference Result 1922 states and 2665 transitions. [2025-02-08 00:11:57,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-02-08 00:11:57,842 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 5.042553191489362) internal successors, (237), 46 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-02-08 00:11:57,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:57,846 INFO L225 Difference]: With dead ends: 1922 [2025-02-08 00:11:57,846 INFO L226 Difference]: Without dead ends: 1396 [2025-02-08 00:11:57,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3052 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=744, Invalid=12828, Unknown=0, NotChecked=0, Total=13572 [2025-02-08 00:11:57,850 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 1096 mSDsluCounter, 3688 mSDsCounter, 0 mSdLazyCounter, 2943 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 3798 SdHoareTripleChecker+Invalid, 2961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:57,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 3798 Invalid, 2961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2943 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 00:11:57,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2025-02-08 00:11:57,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1252. [2025-02-08 00:11:57,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1251 states have (on average 1.3772981614708233) internal successors, (1723), 1251 states have internal predecessors, (1723), 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-08 00:11:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1723 transitions. [2025-02-08 00:11:57,871 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1723 transitions. Word has length 83 [2025-02-08 00:11:57,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:57,871 INFO L471 AbstractCegarLoop]: Abstraction has 1252 states and 1723 transitions. [2025-02-08 00:11:57,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 5.042553191489362) internal successors, (237), 46 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:57,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1723 transitions. [2025-02-08 00:11:57,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 00:11:57,874 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:57,874 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:57,889 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-08 00:11:58,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:11:58,078 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:58,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:58,079 INFO L85 PathProgramCache]: Analyzing trace with hash -455417081, now seen corresponding path program 1 times [2025-02-08 00:11:58,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:58,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994962550] [2025-02-08 00:11:58,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:58,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:58,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 00:11:58,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 00:11:58,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:58,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:58,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:58,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994962550] [2025-02-08 00:11:58,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994962550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:58,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:58,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 00:11:58,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986595838] [2025-02-08 00:11:58,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:58,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:11:58,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:58,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:11:58,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:11:58,349 INFO L87 Difference]: Start difference. First operand 1252 states and 1723 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 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-08 00:11:58,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:58,503 INFO L93 Difference]: Finished difference Result 1861 states and 2595 transitions. [2025-02-08 00:11:58,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:11:58,504 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 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 83 [2025-02-08 00:11:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:58,508 INFO L225 Difference]: With dead ends: 1861 [2025-02-08 00:11:58,508 INFO L226 Difference]: Without dead ends: 1350 [2025-02-08 00:11:58,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:11:58,510 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 11 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:58,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1221 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:11:58,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2025-02-08 00:11:58,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1327. [2025-02-08 00:11:58,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 1326 states have (on average 1.3725490196078431) internal successors, (1820), 1326 states have internal predecessors, (1820), 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-08 00:11:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1820 transitions. [2025-02-08 00:11:58,536 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1820 transitions. Word has length 83 [2025-02-08 00:11:58,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:58,537 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 1820 transitions. [2025-02-08 00:11:58,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 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-08 00:11:58,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1820 transitions. [2025-02-08 00:11:58,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 00:11:58,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:58,539 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:58,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 00:11:58,540 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:58,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:58,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1701610733, now seen corresponding path program 1 times [2025-02-08 00:11:58,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:58,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124851812] [2025-02-08 00:11:58,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:58,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:58,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 00:11:58,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 00:11:58,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:58,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:58,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:58,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124851812] [2025-02-08 00:11:58,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124851812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:58,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:58,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:11:58,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600555403] [2025-02-08 00:11:58,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:58,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 00:11:58,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:58,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 00:11:58,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 00:11:58,812 INFO L87 Difference]: Start difference. First operand 1327 states and 1820 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-08 00:11:58,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:58,868 INFO L93 Difference]: Finished difference Result 2141 states and 2957 transitions. [2025-02-08 00:11:58,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 00:11:58,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 83 [2025-02-08 00:11:58,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:58,875 INFO L225 Difference]: With dead ends: 2141 [2025-02-08 00:11:58,876 INFO L226 Difference]: Without dead ends: 1303 [2025-02-08 00:11:58,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 00:11:58,878 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 2 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:58,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 291 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:11:58,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2025-02-08 00:11:58,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1303. [2025-02-08 00:11:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 1302 states have (on average 1.370199692780338) internal successors, (1784), 1302 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1784 transitions. [2025-02-08 00:11:58,902 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 1784 transitions. Word has length 83 [2025-02-08 00:11:58,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:58,902 INFO L471 AbstractCegarLoop]: Abstraction has 1303 states and 1784 transitions. [2025-02-08 00:11:58,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-08 00:11:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1784 transitions. [2025-02-08 00:11:58,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 00:11:58,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:58,905 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:58,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 00:11:58,905 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:58,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:58,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2080754714, now seen corresponding path program 1 times [2025-02-08 00:11:58,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:58,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957243967] [2025-02-08 00:11:58,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:58,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:58,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 00:11:59,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 00:11:59,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:59,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:11:59,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:59,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957243967] [2025-02-08 00:11:59,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957243967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:59,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:59,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 00:11:59,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068260919] [2025-02-08 00:11:59,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:59,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 00:11:59,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:59,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 00:11:59,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:11:59,592 INFO L87 Difference]: Start difference. First operand 1303 states and 1784 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:59,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:59,880 INFO L93 Difference]: Finished difference Result 2213 states and 3089 transitions. [2025-02-08 00:11:59,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 00:11:59,880 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-08 00:11:59,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:59,885 INFO L225 Difference]: With dead ends: 2213 [2025-02-08 00:11:59,885 INFO L226 Difference]: Without dead ends: 1603 [2025-02-08 00:11:59,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:11:59,887 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 61 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:59,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1678 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:11:59,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-02-08 00:11:59,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1575. [2025-02-08 00:11:59,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1574 states have (on average 1.3799237611181703) internal successors, (2172), 1574 states have internal predecessors, (2172), 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-08 00:11:59,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2172 transitions. [2025-02-08 00:11:59,911 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2172 transitions. Word has length 84 [2025-02-08 00:11:59,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:59,911 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2172 transitions. [2025-02-08 00:11:59,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:59,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2172 transitions. [2025-02-08 00:11:59,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 00:11:59,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:59,913 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:11:59,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 00:11:59,913 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:59,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:59,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2058426031, now seen corresponding path program 1 times [2025-02-08 00:11:59,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:59,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008325411] [2025-02-08 00:11:59,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:59,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:59,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 00:11:59,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 00:11:59,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:59,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:00,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:00,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008325411] [2025-02-08 00:12:00,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008325411] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:00,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:00,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:12:00,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109850020] [2025-02-08 00:12:00,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:00,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:12:00,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:00,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:12:00,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:12:00,086 INFO L87 Difference]: Start difference. First operand 1575 states and 2172 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:00,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:00,178 INFO L93 Difference]: Finished difference Result 2511 states and 3511 transitions. [2025-02-08 00:12:00,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:12:00,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-08 00:12:00,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:00,182 INFO L225 Difference]: With dead ends: 2511 [2025-02-08 00:12:00,183 INFO L226 Difference]: Without dead ends: 1634 [2025-02-08 00:12:00,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:12:00,184 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 60 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:00,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 542 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:00,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2025-02-08 00:12:00,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2025-02-08 00:12:00,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1633 states have (on average 1.3772198407838334) internal successors, (2249), 1633 states have internal predecessors, (2249), 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-08 00:12:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2249 transitions. [2025-02-08 00:12:00,214 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2249 transitions. Word has length 84 [2025-02-08 00:12:00,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:00,214 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2249 transitions. [2025-02-08 00:12:00,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:00,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2249 transitions. [2025-02-08 00:12:00,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 00:12:00,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:00,217 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:12:00,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 00:12:00,218 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:00,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:00,219 INFO L85 PathProgramCache]: Analyzing trace with hash 411687166, now seen corresponding path program 1 times [2025-02-08 00:12:00,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:00,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347754283] [2025-02-08 00:12:00,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:00,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:00,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 00:12:00,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 00:12:00,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:00,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:00,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:00,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:00,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347754283] [2025-02-08 00:12:00,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347754283] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:12:00,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134157514] [2025-02-08 00:12:00,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:00,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:12:00,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:12:00,760 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:12:00,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 00:12:00,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 00:12:00,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 00:12:00,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:00,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:00,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 00:12:00,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:12:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:01,173 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:12:01,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134157514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:01,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 00:12:01,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 23 [2025-02-08 00:12:01,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847229133] [2025-02-08 00:12:01,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:01,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:12:01,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:01,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:12:01,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2025-02-08 00:12:01,175 INFO L87 Difference]: Start difference. First operand 1634 states and 2249 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:01,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:01,331 INFO L93 Difference]: Finished difference Result 2730 states and 3820 transitions. [2025-02-08 00:12:01,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:12:01,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-08 00:12:01,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:01,337 INFO L225 Difference]: With dead ends: 2730 [2025-02-08 00:12:01,337 INFO L226 Difference]: Without dead ends: 1862 [2025-02-08 00:12:01,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2025-02-08 00:12:01,339 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 35 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:01,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1032 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:01,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2025-02-08 00:12:01,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1662. [2025-02-08 00:12:01,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1661 states have (on average 1.3756773028296208) internal successors, (2285), 1661 states have internal predecessors, (2285), 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-08 00:12:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2285 transitions. [2025-02-08 00:12:01,368 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2285 transitions. Word has length 84 [2025-02-08 00:12:01,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:01,368 INFO L471 AbstractCegarLoop]: Abstraction has 1662 states and 2285 transitions. [2025-02-08 00:12:01,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:01,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2285 transitions. [2025-02-08 00:12:01,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 00:12:01,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:01,371 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:12:01,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 00:12:01,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-08 00:12:01,572 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:01,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:01,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1524945637, now seen corresponding path program 1 times [2025-02-08 00:12:01,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:01,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017596249] [2025-02-08 00:12:01,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:01,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:01,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 00:12:01,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 00:12:01,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:01,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:01,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:01,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:01,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017596249] [2025-02-08 00:12:01,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017596249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:01,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:01,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:12:01,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541797136] [2025-02-08 00:12:01,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:01,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:12:01,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:01,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:12:01,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:12:01,854 INFO L87 Difference]: Start difference. First operand 1662 states and 2285 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:01,992 INFO L93 Difference]: Finished difference Result 2616 states and 3642 transitions. [2025-02-08 00:12:01,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:12:01,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-08 00:12:01,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:02,004 INFO L225 Difference]: With dead ends: 2616 [2025-02-08 00:12:02,004 INFO L226 Difference]: Without dead ends: 1662 [2025-02-08 00:12:02,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:12:02,006 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 97 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:02,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 707 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:02,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2025-02-08 00:12:02,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1662. [2025-02-08 00:12:02,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1661 states have (on average 1.3708609271523178) internal successors, (2277), 1661 states have internal predecessors, (2277), 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-08 00:12:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2277 transitions. [2025-02-08 00:12:02,029 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2277 transitions. Word has length 84 [2025-02-08 00:12:02,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:02,030 INFO L471 AbstractCegarLoop]: Abstraction has 1662 states and 2277 transitions. [2025-02-08 00:12:02,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:02,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2277 transitions. [2025-02-08 00:12:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 00:12:02,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:02,032 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:02,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 00:12:02,033 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:02,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:02,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1091443049, now seen corresponding path program 1 times [2025-02-08 00:12:02,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:02,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165450543] [2025-02-08 00:12:02,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:02,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:02,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 00:12:02,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 00:12:02,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:02,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:02,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:02,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:02,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165450543] [2025-02-08 00:12:02,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165450543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:02,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:02,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:12:02,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16266461] [2025-02-08 00:12:02,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:02,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:12:02,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:02,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:12:02,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:12:02,352 INFO L87 Difference]: Start difference. First operand 1662 states and 2277 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:02,457 INFO L93 Difference]: Finished difference Result 2763 states and 3824 transitions. [2025-02-08 00:12:02,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:12:02,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-08 00:12:02,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:02,462 INFO L225 Difference]: With dead ends: 2763 [2025-02-08 00:12:02,462 INFO L226 Difference]: Without dead ends: 1838 [2025-02-08 00:12:02,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:12:02,464 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 5 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:02,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 845 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:02,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-02-08 00:12:02,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1834. [2025-02-08 00:12:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1833 states have (on average 1.3513366066557555) internal successors, (2477), 1833 states have internal predecessors, (2477), 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-08 00:12:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2477 transitions. [2025-02-08 00:12:02,486 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2477 transitions. Word has length 84 [2025-02-08 00:12:02,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:02,486 INFO L471 AbstractCegarLoop]: Abstraction has 1834 states and 2477 transitions. [2025-02-08 00:12:02,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:02,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2477 transitions. [2025-02-08 00:12:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 00:12:02,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:02,488 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:12:02,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 00:12:02,489 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:02,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:02,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1404094417, now seen corresponding path program 1 times [2025-02-08 00:12:02,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:02,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251747004] [2025-02-08 00:12:02,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:02,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:02,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 00:12:02,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 00:12:02,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:02,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:02,930 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:02,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:02,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251747004] [2025-02-08 00:12:02,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251747004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:02,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:02,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-08 00:12:02,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835182543] [2025-02-08 00:12:02,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:02,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 00:12:02,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:02,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 00:12:02,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-02-08 00:12:02,932 INFO L87 Difference]: Start difference. First operand 1834 states and 2477 transitions. Second operand has 15 states, 15 states have (on average 5.6) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:03,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:03,226 INFO L93 Difference]: Finished difference Result 2884 states and 3938 transitions. [2025-02-08 00:12:03,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 00:12:03,226 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-08 00:12:03,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:03,231 INFO L225 Difference]: With dead ends: 2884 [2025-02-08 00:12:03,231 INFO L226 Difference]: Without dead ends: 1894 [2025-02-08 00:12:03,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-08 00:12:03,233 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 68 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:03,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1463 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:12:03,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2025-02-08 00:12:03,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1818. [2025-02-08 00:12:03,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1817 states have (on average 1.3478260869565217) internal successors, (2449), 1817 states have internal predecessors, (2449), 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-08 00:12:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2449 transitions. [2025-02-08 00:12:03,256 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 2449 transitions. Word has length 84 [2025-02-08 00:12:03,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:03,256 INFO L471 AbstractCegarLoop]: Abstraction has 1818 states and 2449 transitions. [2025-02-08 00:12:03,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:03,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2449 transitions. [2025-02-08 00:12:03,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 00:12:03,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:03,259 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:12:03,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 00:12:03,259 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:03,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:03,259 INFO L85 PathProgramCache]: Analyzing trace with hash -528378060, now seen corresponding path program 1 times [2025-02-08 00:12:03,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:03,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271754501] [2025-02-08 00:12:03,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:03,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:03,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 00:12:03,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 00:12:03,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:03,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:03,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:03,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271754501] [2025-02-08 00:12:03,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271754501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:03,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:03,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:12:03,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31521472] [2025-02-08 00:12:03,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:03,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:12:03,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:03,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:12:03,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:12:03,403 INFO L87 Difference]: Start difference. First operand 1818 states and 2449 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:03,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:03,494 INFO L93 Difference]: Finished difference Result 3153 states and 4271 transitions. [2025-02-08 00:12:03,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:12:03,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-08 00:12:03,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:03,498 INFO L225 Difference]: With dead ends: 3153 [2025-02-08 00:12:03,499 INFO L226 Difference]: Without dead ends: 1404 [2025-02-08 00:12:03,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-08 00:12:03,501 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 53 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:03,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 543 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:03,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2025-02-08 00:12:03,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1404. [2025-02-08 00:12:03,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1403 states have (on average 1.361368496079829) internal successors, (1910), 1403 states have internal predecessors, (1910), 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-08 00:12:03,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1910 transitions. [2025-02-08 00:12:03,518 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1910 transitions. Word has length 84 [2025-02-08 00:12:03,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:03,518 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 1910 transitions. [2025-02-08 00:12:03,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:03,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1910 transitions. [2025-02-08 00:12:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 00:12:03,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:03,524 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:12:03,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 00:12:03,524 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:03,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:03,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1543440392, now seen corresponding path program 1 times [2025-02-08 00:12:03,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:03,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626835411] [2025-02-08 00:12:03,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:03,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:03,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 00:12:03,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 00:12:03,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:03,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:03,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:03,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:03,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626835411] [2025-02-08 00:12:03,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626835411] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:03,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:03,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:12:03,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297683958] [2025-02-08 00:12:03,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:03,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:12:03,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:03,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:12:03,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:12:03,710 INFO L87 Difference]: Start difference. First operand 1404 states and 1910 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-08 00:12:03,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:03,799 INFO L93 Difference]: Finished difference Result 2817 states and 3839 transitions. [2025-02-08 00:12:03,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:12:03,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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 85 [2025-02-08 00:12:03,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:03,807 INFO L225 Difference]: With dead ends: 2817 [2025-02-08 00:12:03,807 INFO L226 Difference]: Without dead ends: 1450 [2025-02-08 00:12:03,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:12:03,809 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 9 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:03,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 844 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:03,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2025-02-08 00:12:03,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1447. [2025-02-08 00:12:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1446 states have (on average 1.3609958506224067) internal successors, (1968), 1446 states have internal predecessors, (1968), 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-08 00:12:03,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1968 transitions. [2025-02-08 00:12:03,827 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1968 transitions. Word has length 85 [2025-02-08 00:12:03,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:03,827 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 1968 transitions. [2025-02-08 00:12:03,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-08 00:12:03,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1968 transitions. [2025-02-08 00:12:03,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 00:12:03,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:03,829 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:03,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 00:12:03,829 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:03,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:03,830 INFO L85 PathProgramCache]: Analyzing trace with hash 282717167, now seen corresponding path program 1 times [2025-02-08 00:12:03,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:03,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635549703] [2025-02-08 00:12:03,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:03,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:03,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 00:12:03,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 00:12:03,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:03,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:04,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:04,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635549703] [2025-02-08 00:12:04,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635549703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:04,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:04,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 00:12:04,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697432733] [2025-02-08 00:12:04,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:04,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 00:12:04,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:04,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 00:12:04,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:12:04,280 INFO L87 Difference]: Start difference. First operand 1447 states and 1968 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-08 00:12:04,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:04,482 INFO L93 Difference]: Finished difference Result 2818 states and 3920 transitions. [2025-02-08 00:12:04,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:12:04,482 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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 85 [2025-02-08 00:12:04,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:04,486 INFO L225 Difference]: With dead ends: 2818 [2025-02-08 00:12:04,486 INFO L226 Difference]: Without dead ends: 1847 [2025-02-08 00:12:04,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:12:04,488 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 50 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:04,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1107 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:12:04,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2025-02-08 00:12:04,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1683. [2025-02-08 00:12:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1682 states have (on average 1.3781212841854935) internal successors, (2318), 1682 states have internal predecessors, (2318), 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-08 00:12:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2318 transitions. [2025-02-08 00:12:04,506 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2318 transitions. Word has length 85 [2025-02-08 00:12:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:04,506 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2318 transitions. [2025-02-08 00:12:04,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-08 00:12:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2318 transitions. [2025-02-08 00:12:04,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 00:12:04,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:04,508 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:12:04,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 00:12:04,509 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:04,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:04,509 INFO L85 PathProgramCache]: Analyzing trace with hash -440631455, now seen corresponding path program 1 times [2025-02-08 00:12:04,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:04,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682591069] [2025-02-08 00:12:04,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:04,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:04,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 00:12:04,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 00:12:04,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:04,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:05,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:05,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682591069] [2025-02-08 00:12:05,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682591069] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:12:05,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793026252] [2025-02-08 00:12:05,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:05,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:12:05,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:12:05,286 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:12:05,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 00:12:05,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 00:12:05,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 00:12:05,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:05,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:05,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-08 00:12:05,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:12:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:06,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:12:06,818 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:06,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793026252] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:12:06,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:12:06,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 47 [2025-02-08 00:12:06,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271505717] [2025-02-08 00:12:06,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:12:06,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-08 00:12:06,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:06,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-08 00:12:06,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2122, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 00:12:06,820 INFO L87 Difference]: Start difference. First operand 1683 states and 2318 transitions. Second operand has 48 states, 48 states have (on average 4.354166666666667) internal successors, (209), 47 states have internal predecessors, (209), 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-08 00:12:08,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:08,550 INFO L93 Difference]: Finished difference Result 3030 states and 4203 transitions. [2025-02-08 00:12:08,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-08 00:12:08,550 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.354166666666667) internal successors, (209), 47 states have internal predecessors, (209), 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 85 [2025-02-08 00:12:08,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:08,554 INFO L225 Difference]: With dead ends: 3030 [2025-02-08 00:12:08,554 INFO L226 Difference]: Without dead ends: 1835 [2025-02-08 00:12:08,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 138 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 913 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=383, Invalid=4873, Unknown=0, NotChecked=0, Total=5256 [2025-02-08 00:12:08,557 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 350 mSDsluCounter, 4279 mSDsCounter, 0 mSdLazyCounter, 2670 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 4411 SdHoareTripleChecker+Invalid, 2682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:08,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 4411 Invalid, 2682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2670 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 00:12:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2025-02-08 00:12:08,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1737. [2025-02-08 00:12:08,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1736 states have (on average 1.3784562211981566) internal successors, (2393), 1736 states have internal predecessors, (2393), 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-08 00:12:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2393 transitions. [2025-02-08 00:12:08,574 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2393 transitions. Word has length 85 [2025-02-08 00:12:08,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:08,574 INFO L471 AbstractCegarLoop]: Abstraction has 1737 states and 2393 transitions. [2025-02-08 00:12:08,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.354166666666667) internal successors, (209), 47 states have internal predecessors, (209), 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-08 00:12:08,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2393 transitions. [2025-02-08 00:12:08,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 00:12:08,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:08,576 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:12:08,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 00:12:08,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:12:08,777 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:08,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:08,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1432736772, now seen corresponding path program 1 times [2025-02-08 00:12:08,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:08,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592072595] [2025-02-08 00:12:08,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:08,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:08,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 00:12:08,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 00:12:08,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:08,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:09,483 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:09,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:09,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592072595] [2025-02-08 00:12:09,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592072595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:09,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:09,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-08 00:12:09,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901377682] [2025-02-08 00:12:09,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:09,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 00:12:09,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:09,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 00:12:09,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2025-02-08 00:12:09,485 INFO L87 Difference]: Start difference. First operand 1737 states and 2393 transitions. Second operand has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 19 states have internal predecessors, (85), 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-08 00:12:10,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:10,131 INFO L93 Difference]: Finished difference Result 3592 states and 5004 transitions. [2025-02-08 00:12:10,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-08 00:12:10,131 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 19 states have internal predecessors, (85), 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 85 [2025-02-08 00:12:10,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:10,137 INFO L225 Difference]: With dead ends: 3592 [2025-02-08 00:12:10,137 INFO L226 Difference]: Without dead ends: 2397 [2025-02-08 00:12:10,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2025-02-08 00:12:10,143 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 159 mSDsluCounter, 3200 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 3426 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:10,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 3426 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:12:10,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2025-02-08 00:12:10,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 2129. [2025-02-08 00:12:10,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2129 states, 2128 states have (on average 1.3839285714285714) internal successors, (2945), 2128 states have internal predecessors, (2945), 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-08 00:12:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 2945 transitions. [2025-02-08 00:12:10,164 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 2945 transitions. Word has length 85 [2025-02-08 00:12:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:10,165 INFO L471 AbstractCegarLoop]: Abstraction has 2129 states and 2945 transitions. [2025-02-08 00:12:10,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 19 states have internal predecessors, (85), 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-08 00:12:10,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 2945 transitions. [2025-02-08 00:12:10,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 00:12:10,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:10,166 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:10,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 00:12:10,167 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:10,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:10,167 INFO L85 PathProgramCache]: Analyzing trace with hash 664091089, now seen corresponding path program 1 times [2025-02-08 00:12:10,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:10,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322622068] [2025-02-08 00:12:10,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:10,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:10,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 00:12:10,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 00:12:10,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:10,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:10,520 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:10,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:10,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322622068] [2025-02-08 00:12:10,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322622068] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:10,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:10,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 00:12:10,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395772777] [2025-02-08 00:12:10,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:10,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 00:12:10,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:10,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 00:12:10,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:12:10,522 INFO L87 Difference]: Start difference. First operand 2129 states and 2945 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 11 states have internal predecessors, (85), 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-08 00:12:10,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:10,726 INFO L93 Difference]: Finished difference Result 3903 states and 5419 transitions. [2025-02-08 00:12:10,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 00:12:10,727 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 11 states have internal predecessors, (85), 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 85 [2025-02-08 00:12:10,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:10,730 INFO L225 Difference]: With dead ends: 3903 [2025-02-08 00:12:10,730 INFO L226 Difference]: Without dead ends: 2295 [2025-02-08 00:12:10,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:12:10,732 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 102 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:10,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1444 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:12:10,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2025-02-08 00:12:10,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 2295. [2025-02-08 00:12:10,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 2294 states have (on average 1.3644289450741063) internal successors, (3130), 2294 states have internal predecessors, (3130), 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-08 00:12:10,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 3130 transitions. [2025-02-08 00:12:10,764 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 3130 transitions. Word has length 85 [2025-02-08 00:12:10,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:10,764 INFO L471 AbstractCegarLoop]: Abstraction has 2295 states and 3130 transitions. [2025-02-08 00:12:10,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 11 states have internal predecessors, (85), 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-08 00:12:10,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 3130 transitions. [2025-02-08 00:12:10,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 00:12:10,766 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:10,766 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:10,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 00:12:10,767 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:10,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:10,767 INFO L85 PathProgramCache]: Analyzing trace with hash 2016786230, now seen corresponding path program 1 times [2025-02-08 00:12:10,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:10,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889618343] [2025-02-08 00:12:10,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:10,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:10,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 00:12:10,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 00:12:10,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:10,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:11,163 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:11,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:11,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889618343] [2025-02-08 00:12:11,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889618343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:11,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:11,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 00:12:11,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659282793] [2025-02-08 00:12:11,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:11,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 00:12:11,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:11,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 00:12:11,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-08 00:12:11,164 INFO L87 Difference]: Start difference. First operand 2295 states and 3130 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 13 states have internal predecessors, (85), 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-08 00:12:11,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:11,518 INFO L93 Difference]: Finished difference Result 3850 states and 5328 transitions. [2025-02-08 00:12:11,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 00:12:11,518 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 13 states have internal predecessors, (85), 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 85 [2025-02-08 00:12:11,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:11,522 INFO L225 Difference]: With dead ends: 3850 [2025-02-08 00:12:11,522 INFO L226 Difference]: Without dead ends: 2307 [2025-02-08 00:12:11,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2025-02-08 00:12:11,523 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 125 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:11,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1570 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:12:11,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-02-08 00:12:11,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-02-08 00:12:11,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.3616652211621856) internal successors, (3140), 2306 states have internal predecessors, (3140), 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-08 00:12:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3140 transitions. [2025-02-08 00:12:11,540 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3140 transitions. Word has length 85 [2025-02-08 00:12:11,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:11,541 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3140 transitions. [2025-02-08 00:12:11,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 13 states have internal predecessors, (85), 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-08 00:12:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3140 transitions. [2025-02-08 00:12:11,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 00:12:11,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:11,542 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:12:11,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-08 00:12:11,543 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:11,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:11,543 INFO L85 PathProgramCache]: Analyzing trace with hash -769448294, now seen corresponding path program 1 times [2025-02-08 00:12:11,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:11,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631570605] [2025-02-08 00:12:11,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:11,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:11,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 00:12:11,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 00:12:11,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:11,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:12,121 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:12,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:12,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631570605] [2025-02-08 00:12:12,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631570605] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:12,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:12,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-08 00:12:12,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124397253] [2025-02-08 00:12:12,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:12,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 00:12:12,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:12,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 00:12:12,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-02-08 00:12:12,123 INFO L87 Difference]: Start difference. First operand 2307 states and 3140 transitions. Second operand has 20 states, 20 states have (on average 4.25) internal successors, (85), 19 states have internal predecessors, (85), 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-08 00:12:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:12,704 INFO L93 Difference]: Finished difference Result 3867 states and 5344 transitions. [2025-02-08 00:12:12,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 00:12:12,704 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 19 states have internal predecessors, (85), 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 85 [2025-02-08 00:12:12,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:12,709 INFO L225 Difference]: With dead ends: 3867 [2025-02-08 00:12:12,709 INFO L226 Difference]: Without dead ends: 2331 [2025-02-08 00:12:12,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2025-02-08 00:12:12,711 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 115 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 2582 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:12,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 2582 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:12:12,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2025-02-08 00:12:12,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 2315. [2025-02-08 00:12:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2315 states, 2314 states have (on average 1.3604148660328435) internal successors, (3148), 2314 states have internal predecessors, (3148), 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-08 00:12:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 3148 transitions. [2025-02-08 00:12:12,755 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 3148 transitions. Word has length 85 [2025-02-08 00:12:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:12,755 INFO L471 AbstractCegarLoop]: Abstraction has 2315 states and 3148 transitions. [2025-02-08 00:12:12,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 19 states have internal predecessors, (85), 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-08 00:12:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3148 transitions. [2025-02-08 00:12:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-08 00:12:12,757 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:12,757 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:12:12,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-08 00:12:12,757 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:12,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:12,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2086235121, now seen corresponding path program 1 times [2025-02-08 00:12:12,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:12,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718471001] [2025-02-08 00:12:12,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:12,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:12,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 00:12:12,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 00:12:12,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:12,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:13,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:13,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:13,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718471001] [2025-02-08 00:12:13,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718471001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:13,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:13,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-08 00:12:13,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186442197] [2025-02-08 00:12:13,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:13,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 00:12:13,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:13,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 00:12:13,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-02-08 00:12:13,498 INFO L87 Difference]: Start difference. First operand 2315 states and 3148 transitions. Second operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 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-08 00:12:13,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:13,906 INFO L93 Difference]: Finished difference Result 3866 states and 5337 transitions. [2025-02-08 00:12:13,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 00:12:13,907 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 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 86 [2025-02-08 00:12:13,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:13,910 INFO L225 Difference]: With dead ends: 3866 [2025-02-08 00:12:13,910 INFO L226 Difference]: Without dead ends: 2307 [2025-02-08 00:12:13,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2025-02-08 00:12:13,912 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 172 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:13,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1371 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:12:13,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-02-08 00:12:13,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2305. [2025-02-08 00:12:13,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2305 states, 2304 states have (on average 1.3585069444444444) internal successors, (3130), 2304 states have internal predecessors, (3130), 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-08 00:12:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 3130 transitions. [2025-02-08 00:12:13,934 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 3130 transitions. Word has length 86 [2025-02-08 00:12:13,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:13,935 INFO L471 AbstractCegarLoop]: Abstraction has 2305 states and 3130 transitions. [2025-02-08 00:12:13,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 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-08 00:12:13,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 3130 transitions. [2025-02-08 00:12:13,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-08 00:12:13,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:13,936 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:13,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-08 00:12:13,936 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:13,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:13,937 INFO L85 PathProgramCache]: Analyzing trace with hash 146931136, now seen corresponding path program 1 times [2025-02-08 00:12:13,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:13,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852653197] [2025-02-08 00:12:13,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:13,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:13,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 00:12:14,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 00:12:14,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:14,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:14,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:14,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852653197] [2025-02-08 00:12:14,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852653197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:14,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:14,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:12:14,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815259061] [2025-02-08 00:12:14,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:14,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:12:14,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:14,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:12:14,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:12:14,350 INFO L87 Difference]: Start difference. First operand 2305 states and 3130 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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-08 00:12:14,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:14,499 INFO L93 Difference]: Finished difference Result 4196 states and 5826 transitions. [2025-02-08 00:12:14,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:12:14,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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 86 [2025-02-08 00:12:14,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:14,504 INFO L225 Difference]: With dead ends: 4196 [2025-02-08 00:12:14,504 INFO L226 Difference]: Without dead ends: 2627 [2025-02-08 00:12:14,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:12:14,505 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 24 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:14,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 834 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:14,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states. [2025-02-08 00:12:14,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 2481. [2025-02-08 00:12:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2480 states have (on average 1.3612903225806452) internal successors, (3376), 2480 states have internal predecessors, (3376), 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-08 00:12:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3376 transitions. [2025-02-08 00:12:14,525 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3376 transitions. Word has length 86 [2025-02-08 00:12:14,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:14,525 INFO L471 AbstractCegarLoop]: Abstraction has 2481 states and 3376 transitions. [2025-02-08 00:12:14,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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-08 00:12:14,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3376 transitions. [2025-02-08 00:12:14,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-08 00:12:14,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:14,527 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:12:14,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-08 00:12:14,528 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:14,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:14,528 INFO L85 PathProgramCache]: Analyzing trace with hash 488152550, now seen corresponding path program 1 times [2025-02-08 00:12:14,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:14,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431408350] [2025-02-08 00:12:14,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:14,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:14,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 00:12:14,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 00:12:14,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:14,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:15,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:15,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431408350] [2025-02-08 00:12:15,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431408350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:15,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:15,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 00:12:15,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841875451] [2025-02-08 00:12:15,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:15,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 00:12:15,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:15,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 00:12:15,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:12:15,058 INFO L87 Difference]: Start difference. First operand 2481 states and 3376 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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-08 00:12:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:15,270 INFO L93 Difference]: Finished difference Result 4493 states and 6185 transitions. [2025-02-08 00:12:15,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 00:12:15,270 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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 86 [2025-02-08 00:12:15,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:15,274 INFO L225 Difference]: With dead ends: 4493 [2025-02-08 00:12:15,274 INFO L226 Difference]: Without dead ends: 2802 [2025-02-08 00:12:15,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:12:15,276 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 44 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:15,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1484 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:12:15,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2025-02-08 00:12:15,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2637. [2025-02-08 00:12:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2637 states, 2636 states have (on average 1.3649468892261) internal successors, (3598), 2636 states have internal predecessors, (3598), 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-08 00:12:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 3598 transitions. [2025-02-08 00:12:15,299 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 3598 transitions. Word has length 86 [2025-02-08 00:12:15,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:15,299 INFO L471 AbstractCegarLoop]: Abstraction has 2637 states and 3598 transitions. [2025-02-08 00:12:15,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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-08 00:12:15,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 3598 transitions. [2025-02-08 00:12:15,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-08 00:12:15,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:15,303 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:12:15,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-08 00:12:15,303 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:15,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:15,303 INFO L85 PathProgramCache]: Analyzing trace with hash -9912930, now seen corresponding path program 1 times [2025-02-08 00:12:15,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:15,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878885277] [2025-02-08 00:12:15,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:15,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:15,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 00:12:15,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 00:12:15,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:15,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:16,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:16,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878885277] [2025-02-08 00:12:16,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878885277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:16,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:16,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-08 00:12:16,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054257079] [2025-02-08 00:12:16,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:16,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 00:12:16,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:16,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 00:12:16,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-02-08 00:12:16,199 INFO L87 Difference]: Start difference. First operand 2637 states and 3598 transitions. Second operand has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 16 states have internal predecessors, (86), 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-08 00:12:16,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:16,484 INFO L93 Difference]: Finished difference Result 4588 states and 6343 transitions. [2025-02-08 00:12:16,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 00:12:16,484 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 16 states have internal predecessors, (86), 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 86 [2025-02-08 00:12:16,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:16,488 INFO L225 Difference]: With dead ends: 4588 [2025-02-08 00:12:16,488 INFO L226 Difference]: Without dead ends: 2636 [2025-02-08 00:12:16,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-02-08 00:12:16,490 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 65 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:16,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1638 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:12:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-02-08 00:12:16,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2629. [2025-02-08 00:12:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2628 states have (on average 1.3645357686453576) internal successors, (3586), 2628 states have internal predecessors, (3586), 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-08 00:12:16,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 3586 transitions. [2025-02-08 00:12:16,512 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 3586 transitions. Word has length 86 [2025-02-08 00:12:16,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:16,512 INFO L471 AbstractCegarLoop]: Abstraction has 2629 states and 3586 transitions. [2025-02-08 00:12:16,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 16 states have internal predecessors, (86), 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-08 00:12:16,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 3586 transitions. [2025-02-08 00:12:16,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-08 00:12:16,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:16,514 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:16,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-08 00:12:16,514 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:16,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:16,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1651130451, now seen corresponding path program 1 times [2025-02-08 00:12:16,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:16,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831116479] [2025-02-08 00:12:16,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:16,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:16,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 00:12:16,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 00:12:16,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:16,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:17,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:17,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831116479] [2025-02-08 00:12:17,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831116479] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:12:17,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110472932] [2025-02-08 00:12:17,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:17,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:12:17,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:12:17,225 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:12:17,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 00:12:17,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 00:12:17,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 00:12:17,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:17,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:17,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-08 00:12:17,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:12:17,937 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:17,937 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:12:17,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110472932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:17,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 00:12:17,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [18] total 31 [2025-02-08 00:12:17,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332300754] [2025-02-08 00:12:17,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:17,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 00:12:17,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:17,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 00:12:17,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2025-02-08 00:12:17,938 INFO L87 Difference]: Start difference. First operand 2629 states and 3586 transitions. Second operand has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 14 states have internal predecessors, (86), 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-08 00:12:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:18,341 INFO L93 Difference]: Finished difference Result 4575 states and 6324 transitions. [2025-02-08 00:12:18,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 00:12:18,341 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 14 states have internal predecessors, (86), 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 86 [2025-02-08 00:12:18,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:18,345 INFO L225 Difference]: With dead ends: 4575 [2025-02-08 00:12:18,345 INFO L226 Difference]: Without dead ends: 2671 [2025-02-08 00:12:18,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2025-02-08 00:12:18,347 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 71 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:18,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1775 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:12:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2025-02-08 00:12:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 2667. [2025-02-08 00:12:18,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2667 states, 2666 states have (on average 1.3608402100525132) internal successors, (3628), 2666 states have internal predecessors, (3628), 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-08 00:12:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 3628 transitions. [2025-02-08 00:12:18,367 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 3628 transitions. Word has length 86 [2025-02-08 00:12:18,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:18,367 INFO L471 AbstractCegarLoop]: Abstraction has 2667 states and 3628 transitions. [2025-02-08 00:12:18,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 14 states have internal predecessors, (86), 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-08 00:12:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 3628 transitions. [2025-02-08 00:12:18,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-08 00:12:18,369 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:18,369 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:12:18,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 00:12:18,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2025-02-08 00:12:18,570 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:18,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:18,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1871729920, now seen corresponding path program 1 times [2025-02-08 00:12:18,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:18,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157400871] [2025-02-08 00:12:18,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:18,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:18,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 00:12:18,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 00:12:18,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:18,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:19,249 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:19,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:19,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157400871] [2025-02-08 00:12:19,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157400871] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:12:19,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535890688] [2025-02-08 00:12:19,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:19,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:12:19,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:12:19,256 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:12:19,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 00:12:19,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 00:12:19,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 00:12:19,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:19,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:19,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-08 00:12:19,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:12:19,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:19,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:12:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:20,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535890688] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:12:20,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:12:20,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 12] total 42 [2025-02-08 00:12:20,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283805210] [2025-02-08 00:12:20,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:12:20,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-08 00:12:20,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:20,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-08 00:12:20,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1673, Unknown=0, NotChecked=0, Total=1806 [2025-02-08 00:12:20,584 INFO L87 Difference]: Start difference. First operand 2667 states and 3628 transitions. Second operand has 43 states, 43 states have (on average 5.767441860465116) internal successors, (248), 42 states have internal predecessors, (248), 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-08 00:12:22,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:22,501 INFO L93 Difference]: Finished difference Result 5859 states and 8160 transitions. [2025-02-08 00:12:22,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-08 00:12:22,501 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 5.767441860465116) internal successors, (248), 42 states have internal predecessors, (248), 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 86 [2025-02-08 00:12:22,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:22,507 INFO L225 Difference]: With dead ends: 5859 [2025-02-08 00:12:22,507 INFO L226 Difference]: Without dead ends: 3960 [2025-02-08 00:12:22,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=466, Invalid=5540, Unknown=0, NotChecked=0, Total=6006 [2025-02-08 00:12:22,511 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 620 mSDsluCounter, 3481 mSDsCounter, 0 mSdLazyCounter, 3325 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 3613 SdHoareTripleChecker+Invalid, 3338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:22,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 3613 Invalid, 3338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3325 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 00:12:22,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3960 states. [2025-02-08 00:12:22,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3960 to 3087. [2025-02-08 00:12:22,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3087 states, 3086 states have (on average 1.370706416072586) internal successors, (4230), 3086 states have internal predecessors, (4230), 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-08 00:12:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 3087 states and 4230 transitions. [2025-02-08 00:12:22,543 INFO L78 Accepts]: Start accepts. Automaton has 3087 states and 4230 transitions. Word has length 86 [2025-02-08 00:12:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:22,543 INFO L471 AbstractCegarLoop]: Abstraction has 3087 states and 4230 transitions. [2025-02-08 00:12:22,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 5.767441860465116) internal successors, (248), 42 states have internal predecessors, (248), 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-08 00:12:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3087 states and 4230 transitions. [2025-02-08 00:12:22,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-08 00:12:22,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:22,545 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:12:22,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 00:12:22,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:12:22,746 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:22,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:22,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1676353789, now seen corresponding path program 1 times [2025-02-08 00:12:22,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:22,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647644168] [2025-02-08 00:12:22,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:22,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:22,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 00:12:22,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 00:12:22,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:22,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:22,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:22,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647644168] [2025-02-08 00:12:22,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647644168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:22,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:22,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:12:22,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956996498] [2025-02-08 00:12:22,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:22,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:12:22,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:22,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:12:22,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:12:22,858 INFO L87 Difference]: Start difference. First operand 3087 states and 4230 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 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-08 00:12:22,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:22,948 INFO L93 Difference]: Finished difference Result 6106 states and 8369 transitions. [2025-02-08 00:12:22,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:12:22,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 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 86 [2025-02-08 00:12:22,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:22,953 INFO L225 Difference]: With dead ends: 6106 [2025-02-08 00:12:22,953 INFO L226 Difference]: Without dead ends: 3069 [2025-02-08 00:12:22,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-08 00:12:22,960 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 51 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:22,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 542 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:22,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2025-02-08 00:12:22,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 3069. [2025-02-08 00:12:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3069 states, 3068 states have (on average 1.3696219035202086) internal successors, (4202), 3068 states have internal predecessors, (4202), 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-08 00:12:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 4202 transitions. [2025-02-08 00:12:23,003 INFO L78 Accepts]: Start accepts. Automaton has 3069 states and 4202 transitions. Word has length 86 [2025-02-08 00:12:23,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:23,005 INFO L471 AbstractCegarLoop]: Abstraction has 3069 states and 4202 transitions. [2025-02-08 00:12:23,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 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-08 00:12:23,005 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 4202 transitions. [2025-02-08 00:12:23,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-08 00:12:23,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:23,006 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:12:23,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-08 00:12:23,007 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:23,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:23,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1027774645, now seen corresponding path program 1 times [2025-02-08 00:12:23,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:23,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102190906] [2025-02-08 00:12:23,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:23,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:23,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 00:12:23,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 00:12:23,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:23,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:23,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:23,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:23,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102190906] [2025-02-08 00:12:23,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102190906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:23,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:23,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:12:23,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505546578] [2025-02-08 00:12:23,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:23,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:12:23,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:23,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:12:23,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:12:23,105 INFO L87 Difference]: Start difference. First operand 3069 states and 4202 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 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-08 00:12:23,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:23,188 INFO L93 Difference]: Finished difference Result 6092 states and 8345 transitions. [2025-02-08 00:12:23,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:12:23,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 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 86 [2025-02-08 00:12:23,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:23,193 INFO L225 Difference]: With dead ends: 6092 [2025-02-08 00:12:23,193 INFO L226 Difference]: Without dead ends: 3064 [2025-02-08 00:12:23,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-08 00:12:23,195 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 74 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:23,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 542 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:23,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3064 states. [2025-02-08 00:12:23,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3064 to 3064. [2025-02-08 00:12:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3064 states, 3063 states have (on average 1.3689193601044727) internal successors, (4193), 3063 states have internal predecessors, (4193), 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-08 00:12:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3064 states to 3064 states and 4193 transitions. [2025-02-08 00:12:23,225 INFO L78 Accepts]: Start accepts. Automaton has 3064 states and 4193 transitions. Word has length 86 [2025-02-08 00:12:23,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:23,225 INFO L471 AbstractCegarLoop]: Abstraction has 3064 states and 4193 transitions. [2025-02-08 00:12:23,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 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-08 00:12:23,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3064 states and 4193 transitions. [2025-02-08 00:12:23,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 00:12:23,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:23,227 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:23,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-08 00:12:23,227 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:23,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:23,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1482704217, now seen corresponding path program 1 times [2025-02-08 00:12:23,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:23,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888206498] [2025-02-08 00:12:23,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:23,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:23,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 00:12:23,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 00:12:23,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:23,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:23,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:23,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888206498] [2025-02-08 00:12:23,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888206498] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:12:23,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88695739] [2025-02-08 00:12:23,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:23,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:12:23,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:12:23,632 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:12:23,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 00:12:23,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 00:12:23,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 00:12:23,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:23,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:23,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-02-08 00:12:23,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:12:24,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:24,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:12:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:26,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88695739] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:12:26,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:12:26,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 30, 30] total 70 [2025-02-08 00:12:26,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194879969] [2025-02-08 00:12:26,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:12:26,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-02-08 00:12:26,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:26,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-02-08 00:12:26,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=610, Invalid=4360, Unknown=0, NotChecked=0, Total=4970 [2025-02-08 00:12:26,437 INFO L87 Difference]: Start difference. First operand 3064 states and 4193 transitions. Second operand has 71 states, 71 states have (on average 3.056338028169014) internal successors, (217), 70 states have internal predecessors, (217), 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-08 00:12:32,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:32,603 INFO L93 Difference]: Finished difference Result 7137 states and 9882 transitions. [2025-02-08 00:12:32,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2025-02-08 00:12:32,604 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 3.056338028169014) internal successors, (217), 70 states have internal predecessors, (217), 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 87 [2025-02-08 00:12:32,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:32,608 INFO L225 Difference]: With dead ends: 7137 [2025-02-08 00:12:32,608 INFO L226 Difference]: Without dead ends: 4797 [2025-02-08 00:12:32,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4753 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1946, Invalid=16144, Unknown=0, NotChecked=0, Total=18090 [2025-02-08 00:12:32,614 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 1755 mSDsluCounter, 5957 mSDsCounter, 0 mSdLazyCounter, 6355 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1755 SdHoareTripleChecker+Valid, 6103 SdHoareTripleChecker+Invalid, 6407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 6355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:32,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1755 Valid, 6103 Invalid, 6407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 6355 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-08 00:12:32,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4797 states. [2025-02-08 00:12:32,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4797 to 3452. [2025-02-08 00:12:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3451 states have (on average 1.3784410315850477) internal successors, (4757), 3451 states have internal predecessors, (4757), 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-08 00:12:32,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 4757 transitions. [2025-02-08 00:12:32,649 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 4757 transitions. Word has length 87 [2025-02-08 00:12:32,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:32,649 INFO L471 AbstractCegarLoop]: Abstraction has 3452 states and 4757 transitions. [2025-02-08 00:12:32,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 3.056338028169014) internal successors, (217), 70 states have internal predecessors, (217), 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-08 00:12:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 4757 transitions. [2025-02-08 00:12:32,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 00:12:32,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:32,650 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:12:32,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 00:12:32,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:12:32,851 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:32,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:32,851 INFO L85 PathProgramCache]: Analyzing trace with hash -87745378, now seen corresponding path program 1 times [2025-02-08 00:12:32,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:32,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856064442] [2025-02-08 00:12:32,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:32,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:32,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 00:12:32,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 00:12:32,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:32,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:33,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:33,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856064442] [2025-02-08 00:12:33,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856064442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:33,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:33,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-08 00:12:33,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817479346] [2025-02-08 00:12:33,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:33,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 00:12:33,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:33,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 00:12:33,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-02-08 00:12:33,465 INFO L87 Difference]: Start difference. First operand 3452 states and 4757 transitions. Second operand has 16 states, 16 states have (on average 5.4375) internal successors, (87), 15 states have internal predecessors, (87), 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-08 00:12:33,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:33,837 INFO L93 Difference]: Finished difference Result 6184 states and 8631 transitions. [2025-02-08 00:12:33,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 00:12:33,837 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 15 states have internal predecessors, (87), 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 87 [2025-02-08 00:12:33,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:33,841 INFO L225 Difference]: With dead ends: 6184 [2025-02-08 00:12:33,841 INFO L226 Difference]: Without dead ends: 3452 [2025-02-08 00:12:33,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2025-02-08 00:12:33,844 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 85 mSDsluCounter, 1427 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:33,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1574 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:12:33,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3452 states. [2025-02-08 00:12:33,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3452 to 3452. [2025-02-08 00:12:33,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3451 states have (on average 1.3772819472616633) internal successors, (4753), 3451 states have internal predecessors, (4753), 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-08 00:12:33,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 4753 transitions. [2025-02-08 00:12:33,876 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 4753 transitions. Word has length 87 [2025-02-08 00:12:33,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:33,876 INFO L471 AbstractCegarLoop]: Abstraction has 3452 states and 4753 transitions. [2025-02-08 00:12:33,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 15 states have internal predecessors, (87), 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-08 00:12:33,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 4753 transitions. [2025-02-08 00:12:33,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 00:12:33,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:33,878 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:12:33,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-08 00:12:33,878 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:33,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:33,879 INFO L85 PathProgramCache]: Analyzing trace with hash -250941406, now seen corresponding path program 1 times [2025-02-08 00:12:33,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:33,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384392622] [2025-02-08 00:12:33,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:33,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:33,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 00:12:33,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 00:12:33,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:33,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:34,150 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:34,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:34,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384392622] [2025-02-08 00:12:34,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384392622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:34,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:34,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 00:12:34,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948187256] [2025-02-08 00:12:34,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:34,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 00:12:34,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:34,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 00:12:34,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:12:34,151 INFO L87 Difference]: Start difference. First operand 3452 states and 4753 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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-08 00:12:34,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:34,327 INFO L93 Difference]: Finished difference Result 6828 states and 9573 transitions. [2025-02-08 00:12:34,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:12:34,328 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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 87 [2025-02-08 00:12:34,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:34,331 INFO L225 Difference]: With dead ends: 6828 [2025-02-08 00:12:34,331 INFO L226 Difference]: Without dead ends: 4102 [2025-02-08 00:12:34,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:12:34,334 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 42 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:34,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1225 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:34,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2025-02-08 00:12:34,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 3890. [2025-02-08 00:12:34,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3890 states, 3889 states have (on average 1.38878889174595) internal successors, (5401), 3889 states have internal predecessors, (5401), 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-08 00:12:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3890 states to 3890 states and 5401 transitions. [2025-02-08 00:12:34,368 INFO L78 Accepts]: Start accepts. Automaton has 3890 states and 5401 transitions. Word has length 87 [2025-02-08 00:12:34,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:34,368 INFO L471 AbstractCegarLoop]: Abstraction has 3890 states and 5401 transitions. [2025-02-08 00:12:34,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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-08 00:12:34,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states and 5401 transitions. [2025-02-08 00:12:34,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 00:12:34,369 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:34,369 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:12:34,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-08 00:12:34,369 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:34,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:34,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1331326184, now seen corresponding path program 1 times [2025-02-08 00:12:34,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:34,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654810488] [2025-02-08 00:12:34,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:34,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:34,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 00:12:34,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 00:12:34,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:34,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:34,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:34,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:34,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654810488] [2025-02-08 00:12:34,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654810488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:34,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:34,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:12:34,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599741929] [2025-02-08 00:12:34,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:34,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:12:34,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:34,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:12:34,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:12:34,718 INFO L87 Difference]: Start difference. First operand 3890 states and 5401 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 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-08 00:12:34,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:34,868 INFO L93 Difference]: Finished difference Result 7404 states and 10345 transitions. [2025-02-08 00:12:34,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:12:34,868 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 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 87 [2025-02-08 00:12:34,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:34,872 INFO L225 Difference]: With dead ends: 7404 [2025-02-08 00:12:34,872 INFO L226 Difference]: Without dead ends: 3554 [2025-02-08 00:12:34,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:12:34,875 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 90 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:34,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 984 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:34,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2025-02-08 00:12:34,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3554. [2025-02-08 00:12:34,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3554 states, 3553 states have (on average 1.4050098508302842) internal successors, (4992), 3553 states have internal predecessors, (4992), 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-08 00:12:34,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3554 states to 3554 states and 4992 transitions. [2025-02-08 00:12:34,906 INFO L78 Accepts]: Start accepts. Automaton has 3554 states and 4992 transitions. Word has length 87 [2025-02-08 00:12:34,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:34,906 INFO L471 AbstractCegarLoop]: Abstraction has 3554 states and 4992 transitions. [2025-02-08 00:12:34,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 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-08 00:12:34,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3554 states and 4992 transitions. [2025-02-08 00:12:34,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 00:12:34,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:34,907 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:12:34,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-08 00:12:34,907 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:34,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:34,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1473477836, now seen corresponding path program 1 times [2025-02-08 00:12:34,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:34,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975729761] [2025-02-08 00:12:34,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:34,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:34,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 00:12:34,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 00:12:34,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:34,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:35,379 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:35,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:35,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975729761] [2025-02-08 00:12:35,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975729761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:35,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:35,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-08 00:12:35,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047578649] [2025-02-08 00:12:35,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:35,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 00:12:35,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:35,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 00:12:35,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-02-08 00:12:35,383 INFO L87 Difference]: Start difference. First operand 3554 states and 4992 transitions. Second operand has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 14 states have internal predecessors, (88), 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-08 00:12:35,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:35,730 INFO L93 Difference]: Finished difference Result 6775 states and 9580 transitions. [2025-02-08 00:12:35,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 00:12:35,730 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 14 states have internal predecessors, (88), 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 88 [2025-02-08 00:12:35,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:35,733 INFO L225 Difference]: With dead ends: 6775 [2025-02-08 00:12:35,733 INFO L226 Difference]: Without dead ends: 3561 [2025-02-08 00:12:35,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-02-08 00:12:35,736 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 52 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:35,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1657 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:12:35,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3561 states. [2025-02-08 00:12:35,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3561 to 3554. [2025-02-08 00:12:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3554 states, 3553 states have (on average 1.404728398536448) internal successors, (4991), 3553 states have internal predecessors, (4991), 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-08 00:12:35,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3554 states to 3554 states and 4991 transitions. [2025-02-08 00:12:35,768 INFO L78 Accepts]: Start accepts. Automaton has 3554 states and 4991 transitions. Word has length 88 [2025-02-08 00:12:35,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:35,768 INFO L471 AbstractCegarLoop]: Abstraction has 3554 states and 4991 transitions. [2025-02-08 00:12:35,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 14 states have internal predecessors, (88), 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-08 00:12:35,768 INFO L276 IsEmpty]: Start isEmpty. Operand 3554 states and 4991 transitions. [2025-02-08 00:12:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 00:12:35,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:35,769 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:35,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-08 00:12:35,769 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:35,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:35,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1726708996, now seen corresponding path program 1 times [2025-02-08 00:12:35,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:35,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216229557] [2025-02-08 00:12:35,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:35,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:35,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 00:12:35,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 00:12:35,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:35,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:12:35,834 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:12:35,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 00:12:35,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 00:12:35,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:35,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:12:35,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:12:35,916 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:12:35,916 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:12:35,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-08 00:12:35,920 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:12:35,949 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:12:35,950 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:12:35,962 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:12:35,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:12:35 BoogieIcfgContainer [2025-02-08 00:12:35,964 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:12:35,965 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:12:35,965 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:12:35,965 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:12:35,966 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:11:37" (3/4) ... [2025-02-08 00:12:35,967 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 00:12:35,968 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:12:35,968 INFO L158 Benchmark]: Toolchain (without parser) took 59742.95ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 113.1MB in the beginning and 460.2MB in the end (delta: -347.2MB). Peak memory consumption was 263.9MB. Max. memory is 16.1GB. [2025-02-08 00:12:35,968 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:12:35,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.56ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 97.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 00:12:35,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.21ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 86.8MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:12:35,968 INFO L158 Benchmark]: Boogie Preprocessor took 112.64ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 81.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:12:35,968 INFO L158 Benchmark]: IcfgBuilder took 766.94ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 83.8MB in the end (delta: -2.8MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. [2025-02-08 00:12:35,968 INFO L158 Benchmark]: TraceAbstraction took 58520.03ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 83.1MB in the beginning and 460.3MB in the end (delta: -377.2MB). Peak memory consumption was 237.9MB. Max. memory is 16.1GB. [2025-02-08 00:12:35,968 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 755.0MB. Free memory was 460.3MB in the beginning and 460.2MB in the end (delta: 101.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:12:35,970 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.56ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 97.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.21ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 86.8MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.64ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 81.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 766.94ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 83.8MB in the end (delta: -2.8MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. * TraceAbstraction took 58520.03ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 83.1MB in the beginning and 460.3MB in the end (delta: -377.2MB). Peak memory consumption was 237.9MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 755.0MB. Free memory was 460.3MB in the beginning and 460.2MB in the end (delta: 101.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 173, overapproximation of bitwiseAnd at line 203, overapproximation of bitwiseAnd at line 113. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 3); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 8); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (8 - 1); [L35] const SORT_3 var_14 = 0; [L36] const SORT_3 var_30 = 1; [L38] SORT_1 input_2; [L39] SORT_3 input_4; [L40] SORT_3 input_5; [L41] SORT_3 input_6; [L42] SORT_3 input_7; [L43] SORT_3 input_8; [L44] SORT_3 input_9; [L45] SORT_3 input_10; [L46] SORT_3 input_11; [L47] SORT_12 input_13; [L48] SORT_12 input_34; [L49] SORT_12 input_36; [L50] SORT_3 input_38; [L51] SORT_12 input_100; [L52] SORT_3 input_102; [L53] SORT_1 input_105; [L54] SORT_3 input_107; [L55] SORT_3 input_109; [L56] SORT_3 input_111; [L57] SORT_3 input_113; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_30=1] [L59] SORT_3 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_30=1] [L60] SORT_3 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_30=1] [L61] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_30=1] [L62] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L64] SORT_3 init_16_arg_1 = var_14; [L65] state_15 = init_16_arg_1 [L66] SORT_3 init_18_arg_1 = var_14; [L67] state_17 = init_18_arg_1 [L68] SORT_3 init_21_arg_1 = var_14; [L69] state_20 = init_21_arg_1 [L70] SORT_3 init_25_arg_1 = var_14; [L71] state_24 = init_25_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_30=1] [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_34 = __VERIFIER_nondet_uchar() [L85] input_36 = __VERIFIER_nondet_uchar() [L86] input_38 = __VERIFIER_nondet_uchar() [L87] input_100 = __VERIFIER_nondet_uchar() [L88] input_102 = __VERIFIER_nondet_uchar() [L89] input_105 = __VERIFIER_nondet_uchar() [L90] input_107 = __VERIFIER_nondet_uchar() [L91] input_109 = __VERIFIER_nondet_uchar() [L92] input_111 = __VERIFIER_nondet_uchar() [L93] input_113 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_19_arg_0=0, var_19_arg_1=0, var_30=1] [L98] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_30=1] [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_22_arg_0=0, var_22_arg_1=0, var_30=1] [L101] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_30=1] [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = state_24; [L105] SORT_3 var_26 = ~var_26_arg_0; [L106] SORT_3 var_27_arg_0 = var_23; [L107] SORT_3 var_27_arg_1 = var_26; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_27_arg_0=-1, var_27_arg_1=-1, var_30=1] [L108] EXPR var_27_arg_0 | var_27_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1] [L108] SORT_3 var_27 = var_27_arg_0 | var_27_arg_1; [L109] SORT_3 var_31_arg_0 = var_27; [L110] SORT_3 var_31 = ~var_31_arg_0; [L111] SORT_3 var_32_arg_0 = var_30; [L112] SORT_3 var_32_arg_1 = var_31; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_32_arg_0=1, var_32_arg_1=-256] [L113] EXPR var_32_arg_0 & var_32_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1] [L113] SORT_3 var_32 = var_32_arg_0 & var_32_arg_1; [L114] EXPR var_32 & mask_SORT_3 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1] [L114] var_32 = var_32 & mask_SORT_3 [L115] SORT_3 bad_33_arg_0 = var_32; [L116] CALL __VERIFIER_assert(!(bad_33_arg_0)) [L21] COND FALSE !(!(cond)) [L116] RET __VERIFIER_assert(!(bad_33_arg_0)) [L118] SORT_3 var_40_arg_0 = state_17; [L119] SORT_3 var_40 = ~var_40_arg_0; [L120] SORT_3 var_41_arg_0 = state_15; [L121] SORT_3 var_41 = ~var_41_arg_0; [L122] SORT_3 var_42_arg_0 = var_41; [L123] SORT_3 var_42_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1, var_42_arg_0=-1, var_42_arg_1=0] [L124] EXPR var_42_arg_0 & var_42_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1] [L124] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L125] SORT_3 var_43_arg_0 = var_42; [L126] SORT_3 var_43 = ~var_43_arg_0; [L127] SORT_3 var_44_arg_0 = var_40; [L128] SORT_3 var_44_arg_1 = var_43; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1, var_44_arg_0=-1, var_44_arg_1=-1] [L129] EXPR var_44_arg_0 | var_44_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1] [L129] SORT_3 var_44 = var_44_arg_0 | var_44_arg_1; [L130] SORT_3 var_45_arg_0 = var_44; [L131] SORT_3 var_45 = ~var_45_arg_0; [L132] SORT_3 var_46_arg_0 = state_17; [L133] SORT_3 var_46_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1, var_45=-256, var_46_arg_0=0, var_46_arg_1=0] [L134] EXPR var_46_arg_0 & var_46_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1, var_45=-256] [L134] SORT_3 var_46 = var_46_arg_0 & var_46_arg_1; [L135] SORT_3 var_47_arg_0 = var_41; [L136] SORT_3 var_47_arg_1 = var_46; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_45=-256, var_47_arg_0=-1, var_47_arg_1=0] [L137] EXPR var_47_arg_0 | var_47_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_45=-256] [L137] SORT_3 var_47 = var_47_arg_0 | var_47_arg_1; [L138] SORT_3 var_48_arg_0 = var_47; [L139] SORT_3 var_48 = ~var_48_arg_0; [L140] SORT_3 var_49_arg_0 = var_45; [L141] SORT_3 var_49_arg_1 = var_48; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_49_arg_0=-256, var_49_arg_1=-256] [L142] EXPR var_49_arg_0 | var_49_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1] [L142] SORT_3 var_49 = var_49_arg_0 | var_49_arg_1; [L143] SORT_3 next_115_arg_1 = var_49; [L144] SORT_3 var_51_arg_0 = state_20; [L145] SORT_3 var_51 = ~var_51_arg_0; [L146] SORT_3 var_52_arg_0 = state_17; [L147] SORT_3 var_52_arg_1 = var_51; VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_52_arg_0=0, var_52_arg_1=-1] [L148] EXPR var_52_arg_0 | var_52_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1] [L148] SORT_3 var_52 = var_52_arg_0 | var_52_arg_1; [L149] SORT_3 var_53_arg_0 = state_17; [L150] SORT_3 var_53_arg_1 = var_51; VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_52=255, var_53_arg_0=0, var_53_arg_1=-1] [L151] EXPR var_53_arg_0 & var_53_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_52=255] [L151] SORT_3 var_53 = var_53_arg_0 & var_53_arg_1; [L152] SORT_3 var_54_arg_0 = var_53; [L153] SORT_3 var_54 = ~var_54_arg_0; [L154] SORT_3 var_55_arg_0 = var_52; [L155] SORT_3 var_55_arg_1 = var_54; VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_55_arg_0=255, var_55_arg_1=-1] [L156] EXPR var_55_arg_0 & var_55_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1] [L156] SORT_3 var_55 = var_55_arg_0 & var_55_arg_1; [L157] SORT_3 var_56_arg_0 = var_55; [L158] SORT_3 var_56 = ~var_56_arg_0; [L159] SORT_3 next_116_arg_1 = var_56; [L160] SORT_1 var_58_arg_0 = input_2; [L161] SORT_3 var_58 = var_58_arg_0 >> 0; [L162] SORT_1 var_59_arg_0 = input_2; [L163] SORT_3 var_59 = var_59_arg_0 >> 2; [L164] SORT_3 var_60_arg_0 = var_59; [L165] SORT_3 var_60 = ~var_60_arg_0; [L166] SORT_1 var_61_arg_0 = input_2; [L167] SORT_3 var_61 = var_61_arg_0 >> 1; [L168] SORT_3 var_62_arg_0 = var_60; [L169] SORT_3 var_62_arg_1 = var_61; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62_arg_0=-1, var_62_arg_1=0] [L170] EXPR var_62_arg_0 | var_62_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1] [L170] SORT_3 var_62 = var_62_arg_0 | var_62_arg_1; [L171] SORT_3 var_63_arg_0 = var_58; [L172] SORT_3 var_63_arg_1 = var_62; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255, var_63_arg_0=1, var_63_arg_1=255] [L173] EXPR var_63_arg_0 | var_63_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255] [L173] SORT_3 var_63 = var_63_arg_0 | var_63_arg_1; [L174] SORT_3 var_64_arg_0 = var_63; [L175] SORT_3 var_64 = ~var_64_arg_0; [L176] SORT_3 var_65_arg_0 = state_15; [L177] SORT_3 var_65_arg_1 = state_17; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255, var_64=-1, var_65_arg_0=0, var_65_arg_1=0] [L178] EXPR var_65_arg_0 | var_65_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255, var_64=-1] [L178] SORT_3 var_65 = var_65_arg_0 | var_65_arg_1; [L179] SORT_3 var_66_arg_0 = var_64; [L180] SORT_3 var_66_arg_1 = var_65; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255, var_65=0, var_66_arg_0=-1, var_66_arg_1=0] [L181] EXPR var_66_arg_0 | var_66_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255, var_65=0] [L181] SORT_3 var_66 = var_66_arg_0 | var_66_arg_1; [L182] SORT_3 var_67_arg_0 = var_66; [L183] SORT_3 var_67_arg_1 = var_51; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_58=1, var_62=255, var_65=0, var_67_arg_0=255, var_67_arg_1=-1] [L184] EXPR var_67_arg_0 & var_67_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_58=1, var_62=255, var_65=0] [L184] SORT_3 var_67 = var_67_arg_0 & var_67_arg_1; [L185] SORT_3 next_117_arg_1 = var_67; [L186] SORT_3 var_69_arg_0 = state_15; [L187] SORT_3 var_69_arg_1 = state_20; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, state_20=0, var_30=1, var_40=-1, var_58=1, var_62=255, var_65=0, var_69_arg_0=0, var_69_arg_1=0] [L188] EXPR var_69_arg_0 & var_69_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, state_20=0, var_30=1, var_40=-1, var_58=1, var_62=255, var_65=0] [L188] SORT_3 var_69 = var_69_arg_0 & var_69_arg_1; [L189] SORT_3 var_70_arg_0 = var_69; [L190] SORT_3 var_70 = ~var_70_arg_0; [L191] SORT_3 var_71_arg_0 = var_40; [L192] SORT_3 var_71_arg_1 = var_70; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, state_20=0, var_30=1, var_58=1, var_62=255, var_65=0, var_71_arg_0=-1, var_71_arg_1=-1] [L193] EXPR var_71_arg_0 | var_71_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, state_20=0, var_30=1, var_58=1, var_62=255, var_65=0] [L193] SORT_3 var_71 = var_71_arg_0 | var_71_arg_1; [L194] SORT_3 var_72_arg_0 = var_71; [L195] SORT_3 var_72 = ~var_72_arg_0; [L196] SORT_3 var_73_arg_0 = state_20; [L197] SORT_3 var_73_arg_1 = var_65; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_58=1, var_62=255, var_72=-256, var_73_arg_0=0, var_73_arg_1=0] [L198] EXPR var_73_arg_0 | var_73_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_58=1, var_62=255, var_72=-256] [L198] SORT_3 var_73 = var_73_arg_0 | var_73_arg_1; [L199] SORT_3 var_74_arg_0 = var_73; [L200] SORT_3 var_74 = ~var_74_arg_0; [L201] SORT_3 var_75_arg_0 = var_58; [L202] SORT_3 var_75_arg_1 = var_74; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_62=255, var_72=-256, var_74=-1, var_75_arg_0=1, var_75_arg_1=-1] [L203] EXPR var_75_arg_0 & var_75_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_62=255, var_72=-256, var_74=-1] [L203] SORT_3 var_75 = var_75_arg_0 & var_75_arg_1; [L204] SORT_3 var_76_arg_0 = var_75; [L205] SORT_3 var_76 = ~var_76_arg_0; [L206] SORT_3 var_77_arg_0 = var_76; [L207] SORT_3 var_77 = ~var_77_arg_0; [L208] SORT_3 var_78_arg_0 = var_72; [L209] SORT_3 var_78_arg_1 = var_77; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_62=255, var_74=-1, var_78_arg_0=-256, var_78_arg_1=-256] [L210] EXPR var_78_arg_0 | var_78_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_62=255, var_74=-1] [L210] SORT_3 var_78 = var_78_arg_0 | var_78_arg_1; [L211] SORT_3 var_79_arg_0 = var_62; [L212] SORT_3 var_79_arg_1 = var_74; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_78=0, var_79_arg_0=255, var_79_arg_1=-1] [L213] EXPR var_79_arg_0 & var_79_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_78=0] [L213] SORT_3 var_79 = var_79_arg_0 & var_79_arg_1; [L214] SORT_3 var_80_arg_0 = var_78; [L215] SORT_3 var_80_arg_1 = var_79; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_80_arg_0=0, var_80_arg_1=255] [L216] EXPR var_80_arg_0 | var_80_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1] [L216] SORT_3 var_80 = var_80_arg_0 | var_80_arg_1; [L217] SORT_3 next_118_arg_1 = var_80; [L219] state_15 = next_115_arg_1 [L220] state_17 = next_116_arg_1 [L221] state_20 = next_117_arg_1 [L222] state_24 = next_118_arg_1 [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_34 = __VERIFIER_nondet_uchar() [L85] input_36 = __VERIFIER_nondet_uchar() [L86] input_38 = __VERIFIER_nondet_uchar() [L87] input_100 = __VERIFIER_nondet_uchar() [L88] input_102 = __VERIFIER_nondet_uchar() [L89] input_105 = __VERIFIER_nondet_uchar() [L90] input_107 = __VERIFIER_nondet_uchar() [L91] input_109 = __VERIFIER_nondet_uchar() [L92] input_111 = __VERIFIER_nondet_uchar() [L93] input_113 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, state_24=255, var_19_arg_0=0, var_19_arg_1=-256, var_30=1] [L98] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, state_24=255, var_30=1] [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, state_24=255, var_22_arg_0=0, var_22_arg_1=255, var_30=1] [L101] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, state_24=255, var_30=1] [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = state_24; [L105] SORT_3 var_26 = ~var_26_arg_0; [L106] SORT_3 var_27_arg_0 = var_23; [L107] SORT_3 var_27_arg_1 = var_26; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, var_27_arg_0=-256, var_27_arg_1=-256, var_30=1] [L108] EXPR var_27_arg_0 | var_27_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, var_30=1] [L108] SORT_3 var_27 = var_27_arg_0 | var_27_arg_1; [L109] SORT_3 var_31_arg_0 = var_27; [L110] SORT_3 var_31 = ~var_31_arg_0; [L111] SORT_3 var_32_arg_0 = var_30; [L112] SORT_3 var_32_arg_1 = var_31; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, var_30=1, var_32_arg_0=1, var_32_arg_1=-1] [L113] EXPR var_32_arg_0 & var_32_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, var_30=1] [L113] SORT_3 var_32 = var_32_arg_0 & var_32_arg_1; [L114] EXPR var_32 & mask_SORT_3 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, var_30=1] [L114] var_32 = var_32 & mask_SORT_3 [L115] SORT_3 bad_33_arg_0 = var_32; [L116] CALL __VERIFIER_assert(!(bad_33_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.4s, OverallIterations: 50, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 24.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7399 SdHoareTripleChecker+Valid, 14.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7399 mSDsluCounter, 71204 SdHoareTripleChecker+Invalid, 12.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63989 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35281 IncrementalHoareTripleChecker+Invalid, 35418 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 7215 mSDtfsCounter, 35281 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1902 GetRequests, 932 SyntacticMatches, 11 SemanticMatches, 959 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11611 ImplicationChecksByTransitivity, 16.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred in iteration=47, InterpolantAutomatonStates: 750, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 49 MinimizatonAttempts, 4501 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 25.8s InterpolantComputationTime, 4450 NumberOfCodeBlocks, 4450 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 4642 ConstructedInterpolants, 0 QuantifiedInterpolants, 26991 SizeOfPredicates, 31 NumberOfNonLiveVariables, 3849 ConjunctsInSsa, 484 ConjunctsInUnsatCore, 61 InterpolantComputations, 45 PerfectInterpolantSequences, 578/648 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 00:12:35,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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.vis_QF_BV_s1269b_p2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 895ff1e019ffafaf8b2f8e3efbd16ea4845b2e4eac0a4db8b4c86c462883ae8c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:12:37,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:12:37,952 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-08 00:12:37,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:12:37,957 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:12:37,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:12:37,980 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:12:37,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:12:37,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:12:37,980 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:12:37,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:12:37,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:12:37,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:12:37,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:12:37,982 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:12:37,982 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:12:37,982 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:12:37,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:12:37,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:12:37,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:12:37,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:12:37,983 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 00:12:37,983 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 00:12:37,983 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 00:12:37,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:12:37,983 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:12:37,983 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:12:37,983 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:12:37,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:12:37,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:12:37,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:12:37,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:12:37,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:12:37,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:12:37,984 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:12:37,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:12:37,984 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 00:12:37,984 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 00:12:37,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:12:37,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:12:37,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:12:37,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:12:37,984 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 -> 895ff1e019ffafaf8b2f8e3efbd16ea4845b2e4eac0a4db8b4c86c462883ae8c [2025-02-08 00:12:38,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:12:38,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:12:38,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:12:38,249 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:12:38,251 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:12:38,252 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.vis_QF_BV_s1269b_p2.c [2025-02-08 00:12:39,466 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94a21145b/0cddd203a7a6430da3881fb6dd27c9a7/FLAGd9db30317 [2025-02-08 00:12:39,669 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:12:39,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2025-02-08 00:12:39,679 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94a21145b/0cddd203a7a6430da3881fb6dd27c9a7/FLAGd9db30317 [2025-02-08 00:12:40,023 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94a21145b/0cddd203a7a6430da3881fb6dd27c9a7 [2025-02-08 00:12:40,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:12:40,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:12:40,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:12:40,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:12:40,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:12:40,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:12:40" (1/1) ... [2025-02-08 00:12:40,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ab6e30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:40, skipping insertion in model container [2025-02-08 00:12:40,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:12:40" (1/1) ... [2025-02-08 00:12:40,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:12:40,164 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.vis_QF_BV_s1269b_p2.c[1259,1272] [2025-02-08 00:12:40,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:12:40,239 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:12:40,247 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.vis_QF_BV_s1269b_p2.c[1259,1272] [2025-02-08 00:12:40,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:12:40,294 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:12:40,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:40 WrapperNode [2025-02-08 00:12:40,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:12:40,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:12:40,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:12:40,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:12:40,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:40" (1/1) ... [2025-02-08 00:12:40,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:40" (1/1) ... [2025-02-08 00:12:40,333 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 251 [2025-02-08 00:12:40,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:12:40,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:12:40,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:12:40,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:12:40,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:40" (1/1) ... [2025-02-08 00:12:40,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:40" (1/1) ... [2025-02-08 00:12:40,342 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:40" (1/1) ... [2025-02-08 00:12:40,360 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-08 00:12:40,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:40" (1/1) ... [2025-02-08 00:12:40,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:40" (1/1) ... [2025-02-08 00:12:40,370 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:40" (1/1) ... [2025-02-08 00:12:40,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:40" (1/1) ... [2025-02-08 00:12:40,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:40" (1/1) ... [2025-02-08 00:12:40,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:40" (1/1) ... [2025-02-08 00:12:40,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:12:40,383 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:12:40,383 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:12:40,383 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:12:40,384 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:40" (1/1) ... [2025-02-08 00:12:40,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:12:40,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:12:40,409 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-08 00:12:40,413 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-08 00:12:40,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:12:40,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 00:12:40,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:12:40,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:12:40,526 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:12:40,527 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:12:40,737 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-02-08 00:12:40,737 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:12:40,743 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:12:40,746 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:12:40,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:12:40 BoogieIcfgContainer [2025-02-08 00:12:40,747 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:12:40,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:12:40,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:12:40,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:12:40,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:12:40" (1/3) ... [2025-02-08 00:12:40,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712a22e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:12:40, skipping insertion in model container [2025-02-08 00:12:40,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:40" (2/3) ... [2025-02-08 00:12:40,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712a22e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:12:40, skipping insertion in model container [2025-02-08 00:12:40,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:12:40" (3/3) ... [2025-02-08 00:12:40,754 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2025-02-08 00:12:40,764 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:12:40,765 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p2.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:12:40,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:12:40,806 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;@4118d488, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:12:40,808 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:12:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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-08 00:12:40,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 00:12:40,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:40,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 00:12:40,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:40,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:40,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-08 00:12:40,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:12:40,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1073282188] [2025-02-08 00:12:40,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:40,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:12:40,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:12:40,825 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-08 00:12:40,826 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-08 00:12:40,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 00:12:40,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 00:12:40,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:40,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:40,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 00:12:40,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:12:41,060 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-08 00:12:41,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:12:41,061 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:12:41,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073282188] [2025-02-08 00:12:41,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073282188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:41,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:41,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:12:41,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665374084] [2025-02-08 00:12:41,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:41,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:12:41,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:12:41,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:12:41,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:12:41,080 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-08 00:12:41,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:41,104 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2025-02-08 00:12:41,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:12:41,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-02-08 00:12:41,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:41,111 INFO L225 Difference]: With dead ends: 15 [2025-02-08 00:12:41,111 INFO L226 Difference]: Without dead ends: 8 [2025-02-08 00:12:41,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-08 00:12:41,115 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:41,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:12:41,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-02-08 00:12:41,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-02-08 00:12:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-08 00:12:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-08 00:12:41,136 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-08 00:12:41,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:41,136 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-08 00:12:41,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-08 00:12:41,136 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-08 00:12:41,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 00:12:41,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:41,137 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 00:12:41,142 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-08 00:12:41,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:12:41,337 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:41,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:41,338 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-08 00:12:41,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:12:41,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [151386478] [2025-02-08 00:12:41,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:41,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:12:41,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:12:41,341 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-08 00:12:41,342 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-08 00:12:41,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 00:12:41,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 00:12:41,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:41,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:41,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-08 00:12:41,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:12:41,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:41,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:12:41,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:41,753 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:12:41,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151386478] [2025-02-08 00:12:41,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151386478] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 00:12:41,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 00:12:41,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-02-08 00:12:41,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443787011] [2025-02-08 00:12:41,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:41,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:12:41,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:12:41,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:12:41,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:12:41,756 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-08 00:12:41,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:41,780 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2025-02-08 00:12:41,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:12:41,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2025-02-08 00:12:41,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:41,781 INFO L225 Difference]: With dead ends: 8 [2025-02-08 00:12:41,781 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 00:12:41,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:12:41,782 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:41,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:12:41,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 00:12:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 00:12:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 00:12:41,784 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2025-02-08 00:12:41,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:41,784 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 00:12:41,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-08 00:12:41,784 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 00:12:41,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 00:12:41,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:12:41,792 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-08 00:12:41,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:12:41,992 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 00:12:41,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 00:12:42,012 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:12:42,018 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-08 00:12:42,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:12:42 BoogieIcfgContainer [2025-02-08 00:12:42,019 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:12:42,019 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:12:42,019 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:12:42,019 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:12:42,020 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:12:40" (3/4) ... [2025-02-08 00:12:42,021 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 00:12:42,032 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-08 00:12:42,032 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 00:12:42,033 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 00:12:42,033 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 00:12:42,097 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 00:12:42,097 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 00:12:42,097 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:12:42,097 INFO L158 Benchmark]: Toolchain (without parser) took 2068.32ms. Allocated memory is still 83.9MB. Free memory was 58.9MB in the beginning and 18.2MB in the end (delta: 40.7MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2025-02-08 00:12:42,098 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 83.9MB. Free memory was 62.5MB in the beginning and 62.5MB in the end (delta: 37.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:12:42,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.11ms. Allocated memory is still 83.9MB. Free memory was 58.9MB in the beginning and 43.4MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 00:12:42,098 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.29ms. Allocated memory is still 83.9MB. Free memory was 43.4MB in the beginning and 41.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:12:42,098 INFO L158 Benchmark]: Boogie Preprocessor took 44.98ms. Allocated memory is still 83.9MB. Free memory was 41.1MB in the beginning and 38.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:12:42,098 INFO L158 Benchmark]: IcfgBuilder took 363.52ms. Allocated memory is still 83.9MB. Free memory was 38.8MB in the beginning and 53.1MB in the end (delta: -14.3MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2025-02-08 00:12:42,098 INFO L158 Benchmark]: TraceAbstraction took 1270.53ms. Allocated memory is still 83.9MB. Free memory was 52.0MB in the beginning and 26.0MB in the end (delta: 26.0MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2025-02-08 00:12:42,098 INFO L158 Benchmark]: Witness Printer took 77.85ms. Allocated memory is still 83.9MB. Free memory was 26.0MB in the beginning and 18.2MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:12:42,099 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 83.9MB. Free memory was 62.5MB in the beginning and 62.5MB in the end (delta: 37.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.11ms. Allocated memory is still 83.9MB. Free memory was 58.9MB in the beginning and 43.4MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.29ms. Allocated memory is still 83.9MB. Free memory was 43.4MB in the beginning and 41.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.98ms. Allocated memory is still 83.9MB. Free memory was 41.1MB in the beginning and 38.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 363.52ms. Allocated memory is still 83.9MB. Free memory was 38.8MB in the beginning and 53.1MB in the end (delta: -14.3MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1270.53ms. Allocated memory is still 83.9MB. Free memory was 52.0MB in the beginning and 26.0MB in the end (delta: 26.0MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * Witness Printer took 77.85ms. Allocated memory is still 83.9MB. Free memory was 26.0MB in the beginning and 18.2MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 6 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 2 QuantifiedInterpolants, 200 SizeOfPredicates, 6 NumberOfNonLiveVariables, 128 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 00:12:42,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE