./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.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.diagonal.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 16f8726a4add15d0bf2494bd44888be53eb7bc01110882b6fc03ef148c6d9055 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:59:46,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:59:46,969 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 22:59:46,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:59:46,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:59:46,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:59:46,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:59:46,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:59:46,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:59:46,987 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:59:46,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:59:46,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:59:46,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:59:46,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:59:46,987 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:59:46,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:59:46,988 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:59:46,988 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 22:59:46,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:59:46,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:59:46,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:59:46,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:59:46,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:59:46,988 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:59:46,988 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:59:46,988 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:59:46,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:59:46,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:59:46,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:59:46,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:59:46,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:59:46,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:59:46,989 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:59:46,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:59:46,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 22:59:46,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 22:59:46,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:59:46,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:59:46,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:59:46,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:59:46,989 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 -> 16f8726a4add15d0bf2494bd44888be53eb7bc01110882b6fc03ef148c6d9055 [2025-02-07 22:59:47,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:59:47,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:59:47,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:59:47,221 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:59:47,221 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:59:47,222 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.diagonal.c [2025-02-07 22:59:48,423 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4acb7c58/2f89a95056e74e848f94d091a26b4cb5/FLAG5e8127d06 [2025-02-07 22:59:48,655 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:59:48,655 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c [2025-02-07 22:59:48,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4acb7c58/2f89a95056e74e848f94d091a26b4cb5/FLAG5e8127d06 [2025-02-07 22:59:48,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4acb7c58/2f89a95056e74e848f94d091a26b4cb5 [2025-02-07 22:59:48,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:59:49,003 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:59:49,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:59:49,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:59:49,008 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:59:49,009 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:59:48" (1/1) ... [2025-02-07 22:59:49,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4893e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:49, skipping insertion in model container [2025-02-07 22:59:49,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:59:48" (1/1) ... [2025-02-07 22:59:49,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:59:49,120 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.diagonal.c[1248,1261] [2025-02-07 22:59:49,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:59:49,196 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:59:49,203 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.diagonal.c[1248,1261] [2025-02-07 22:59:49,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:59:49,248 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:59:49,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:49 WrapperNode [2025-02-07 22:59:49,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:59:49,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:59:49,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:59:49,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:59:49,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:49" (1/1) ... [2025-02-07 22:59:49,263 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:49" (1/1) ... [2025-02-07 22:59:49,296 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 265 [2025-02-07 22:59:49,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:59:49,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:59:49,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:59:49,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:59:49,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:49" (1/1) ... [2025-02-07 22:59:49,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:49" (1/1) ... [2025-02-07 22:59:49,316 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:49" (1/1) ... [2025-02-07 22:59:49,336 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-07 22:59:49,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:49" (1/1) ... [2025-02-07 22:59:49,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:49" (1/1) ... [2025-02-07 22:59:49,355 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:49" (1/1) ... [2025-02-07 22:59:49,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:49" (1/1) ... [2025-02-07 22:59:49,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:49" (1/1) ... [2025-02-07 22:59:49,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:49" (1/1) ... [2025-02-07 22:59:49,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:59:49,375 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:59:49,375 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:59:49,376 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:59:49,376 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:49" (1/1) ... [2025-02-07 22:59:49,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:59:49,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:49,398 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-07 22:59:49,400 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-07 22:59:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:59:49,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 22:59:49,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:59:49,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:59:49,478 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:59:49,480 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:59:49,851 INFO L? ?]: Removed 150 outVars from TransFormulas that were not future-live. [2025-02-07 22:59:49,852 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:59:49,877 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:59:49,877 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:59:49,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:59:49 BoogieIcfgContainer [2025-02-07 22:59:49,878 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:59:49,880 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:59:49,880 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:59:49,883 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:59:49,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:59:48" (1/3) ... [2025-02-07 22:59:49,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c814646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:59:49, skipping insertion in model container [2025-02-07 22:59:49,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:49" (2/3) ... [2025-02-07 22:59:49,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c814646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:59:49, skipping insertion in model container [2025-02-07 22:59:49,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:59:49" (3/3) ... [2025-02-07 22:59:49,885 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.diagonal.c [2025-02-07 22:59:49,896 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:59:49,898 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.diagonal.c that has 1 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:59:49,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:59:49,946 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;@2bdeb950, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:59:49,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:59:49,950 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 68 states have (on average 1.4852941176470589) internal successors, (101), 69 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:49,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 22:59:49,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:49,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:59:49,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:49,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:49,960 INFO L85 PathProgramCache]: Analyzing trace with hash 912598801, now seen corresponding path program 1 times [2025-02-07 22:59:49,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:59:49,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507833751] [2025-02-07 22:59:49,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:49,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:59:50,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 22:59:50,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 22:59:50,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:50,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:50,340 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-07 22:59:50,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:59:50,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507833751] [2025-02-07 22:59:50,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507833751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:59:50,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:59:50,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:59:50,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966206525] [2025-02-07 22:59:50,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:59:50,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:59:50,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:59:50,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:59:50,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:59:50,368 INFO L87 Difference]: Start difference. First operand has 70 states, 68 states have (on average 1.4852941176470589) internal successors, (101), 69 states have internal predecessors, (101), 0 states have call successors, (0), 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 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:50,454 INFO L93 Difference]: Finished difference Result 131 states and 191 transitions. [2025-02-07 22:59:50,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:59:50,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-02-07 22:59:50,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:50,461 INFO L225 Difference]: With dead ends: 131 [2025-02-07 22:59:50,462 INFO L226 Difference]: Without dead ends: 70 [2025-02-07 22:59:50,466 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-07 22:59:50,468 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:50,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:59:50,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-07 22:59:50,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-02-07 22:59:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 69 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:50,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 100 transitions. [2025-02-07 22:59:50,502 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 100 transitions. Word has length 12 [2025-02-07 22:59:50,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:50,503 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 100 transitions. [2025-02-07 22:59:50,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:50,503 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 100 transitions. [2025-02-07 22:59:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 22:59:50,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:50,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:59:50,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 22:59:50,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:50,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:50,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1769529018, now seen corresponding path program 1 times [2025-02-07 22:59:50,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:59:50,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971007050] [2025-02-07 22:59:50,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:50,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:59:50,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 22:59:50,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 22:59:50,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:50,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:50,629 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-07 22:59:50,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:59:50,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971007050] [2025-02-07 22:59:50,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971007050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:59:50,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:59:50,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:59:50,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286384704] [2025-02-07 22:59:50,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:59:50,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:59:50,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:59:50,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:59:50,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:59:50,632 INFO L87 Difference]: Start difference. First operand 70 states and 100 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:50,696 INFO L93 Difference]: Finished difference Result 133 states and 190 transitions. [2025-02-07 22:59:50,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:59:50,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-02-07 22:59:50,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:50,698 INFO L225 Difference]: With dead ends: 133 [2025-02-07 22:59:50,699 INFO L226 Difference]: Without dead ends: 72 [2025-02-07 22:59:50,699 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-07 22:59:50,699 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:50,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:59:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-07 22:59:50,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-07 22:59:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 71 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2025-02-07 22:59:50,705 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 13 [2025-02-07 22:59:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:50,705 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2025-02-07 22:59:50,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2025-02-07 22:59:50,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 22:59:50,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:50,706 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:59:50,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 22:59:50,706 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:50,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:50,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1384282708, now seen corresponding path program 1 times [2025-02-07 22:59:50,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:59:50,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753688846] [2025-02-07 22:59:50,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:50,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:59:50,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 22:59:50,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 22:59:50,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:50,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:50,953 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-07 22:59:50,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:59:50,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753688846] [2025-02-07 22:59:50,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753688846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:59:50,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:59:50,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:59:50,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857712546] [2025-02-07 22:59:50,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:59:50,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:59:50,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:59:50,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:59:50,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:59:50,955 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:51,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:51,072 INFO L93 Difference]: Finished difference Result 184 states and 261 transitions. [2025-02-07 22:59:51,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:59:51,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-02-07 22:59:51,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:51,073 INFO L225 Difference]: With dead ends: 184 [2025-02-07 22:59:51,073 INFO L226 Difference]: Without dead ends: 121 [2025-02-07 22:59:51,074 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-07 22:59:51,074 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 76 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:51,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 272 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:59:51,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-07 22:59:51,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 74. [2025-02-07 22:59:51,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 73 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:51,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 104 transitions. [2025-02-07 22:59:51,079 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 104 transitions. Word has length 14 [2025-02-07 22:59:51,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:51,079 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 104 transitions. [2025-02-07 22:59:51,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:51,079 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 104 transitions. [2025-02-07 22:59:51,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-07 22:59:51,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:51,080 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 22:59:51,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 22:59:51,080 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:51,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:51,081 INFO L85 PathProgramCache]: Analyzing trace with hash -684299526, now seen corresponding path program 1 times [2025-02-07 22:59:51,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:59:51,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570548782] [2025-02-07 22:59:51,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:51,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:59:51,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-07 22:59:51,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-07 22:59:51,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:51,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:51,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:51,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:59:51,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570548782] [2025-02-07 22:59:51,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570548782] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:59:51,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459012184] [2025-02-07 22:59:51,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:51,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:51,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:51,932 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-07 22:59:51,934 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-07 22:59:52,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-07 22:59:52,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-07 22:59:52,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:52,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:52,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 22:59:52,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:59:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:52,234 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:59:52,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459012184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:59:52,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 22:59:52,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-02-07 22:59:52,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860831352] [2025-02-07 22:59:52,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:59:52,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:59:52,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:59:52,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:59:52,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:59:52,239 INFO L87 Difference]: Start difference. First operand 74 states and 104 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:52,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:52,333 INFO L93 Difference]: Finished difference Result 137 states and 193 transitions. [2025-02-07 22:59:52,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:59:52,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-02-07 22:59:52,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:52,334 INFO L225 Difference]: With dead ends: 137 [2025-02-07 22:59:52,334 INFO L226 Difference]: Without dead ends: 74 [2025-02-07 22:59:52,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-07 22:59:52,335 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 82 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:52,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 106 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:59:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-07 22:59:52,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-07 22:59:52,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 73 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:52,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 103 transitions. [2025-02-07 22:59:52,339 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 103 transitions. Word has length 45 [2025-02-07 22:59:52,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:52,339 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 103 transitions. [2025-02-07 22:59:52,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:52,339 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2025-02-07 22:59:52,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-07 22:59:52,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:52,340 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:59:52,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 22:59:52,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:52,541 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:52,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:52,542 INFO L85 PathProgramCache]: Analyzing trace with hash -209942323, now seen corresponding path program 1 times [2025-02-07 22:59:52,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:59:52,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356325533] [2025-02-07 22:59:52,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:52,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:59:52,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-07 22:59:52,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-07 22:59:52,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:52,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:52,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:59:52,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356325533] [2025-02-07 22:59:52,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356325533] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:59:52,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457970869] [2025-02-07 22:59:52,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:52,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:52,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:52,949 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-07 22:59:52,952 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-07 22:59:53,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-07 22:59:53,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-07 22:59:53,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:53,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:53,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-07 22:59:53,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:59:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:53,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:59:53,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457970869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:59:53,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 22:59:53,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-02-07 22:59:53,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237382899] [2025-02-07 22:59:53,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:59:53,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:59:53,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:59:53,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:59:53,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-07 22:59:53,310 INFO L87 Difference]: Start difference. First operand 74 states and 103 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:53,544 INFO L93 Difference]: Finished difference Result 187 states and 262 transitions. [2025-02-07 22:59:53,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:59:53,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-02-07 22:59:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:53,547 INFO L225 Difference]: With dead ends: 187 [2025-02-07 22:59:53,547 INFO L226 Difference]: Without dead ends: 124 [2025-02-07 22:59:53,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-02-07 22:59:53,548 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 65 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:53,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 270 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:59:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-07 22:59:53,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 98. [2025-02-07 22:59:53,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:53,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 133 transitions. [2025-02-07 22:59:53,567 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 133 transitions. Word has length 46 [2025-02-07 22:59:53,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:53,567 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 133 transitions. [2025-02-07 22:59:53,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:53,567 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 133 transitions. [2025-02-07 22:59:53,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-07 22:59:53,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:53,568 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:59:53,577 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-07 22:59:53,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:53,768 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:53,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:53,769 INFO L85 PathProgramCache]: Analyzing trace with hash 518875049, now seen corresponding path program 1 times [2025-02-07 22:59:53,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:59:53,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869653448] [2025-02-07 22:59:53,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:53,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:59:53,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-07 22:59:53,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-07 22:59:53,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:53,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:54,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:59:54,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869653448] [2025-02-07 22:59:54,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869653448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:59:54,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:59:54,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:59:54,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704881672] [2025-02-07 22:59:54,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:59:54,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:59:54,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:59:54,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:59:54,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:59:54,124 INFO L87 Difference]: Start difference. First operand 98 states and 133 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:54,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:54,293 INFO L93 Difference]: Finished difference Result 249 states and 347 transitions. [2025-02-07 22:59:54,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 22:59:54,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-02-07 22:59:54,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:54,294 INFO L225 Difference]: With dead ends: 249 [2025-02-07 22:59:54,294 INFO L226 Difference]: Without dead ends: 186 [2025-02-07 22:59:54,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:59:54,295 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 111 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:54,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 602 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:59:54,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-07 22:59:54,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 119. [2025-02-07 22:59:54,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.38135593220339) internal successors, (163), 118 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:54,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 163 transitions. [2025-02-07 22:59:54,300 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 163 transitions. Word has length 47 [2025-02-07 22:59:54,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:54,300 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 163 transitions. [2025-02-07 22:59:54,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:54,300 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 163 transitions. [2025-02-07 22:59:54,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-07 22:59:54,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:54,301 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:59:54,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 22:59:54,301 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:54,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:54,302 INFO L85 PathProgramCache]: Analyzing trace with hash 907947819, now seen corresponding path program 1 times [2025-02-07 22:59:54,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:59:54,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220118575] [2025-02-07 22:59:54,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:54,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:59:54,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-07 22:59:54,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-07 22:59:54,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:54,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:54,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:59:54,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220118575] [2025-02-07 22:59:54,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220118575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:59:54,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:59:54,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:59:54,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509206418] [2025-02-07 22:59:54,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:59:54,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:59:54,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:59:54,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:59:54,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:59:54,599 INFO L87 Difference]: Start difference. First operand 119 states and 163 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:54,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:54,848 INFO L93 Difference]: Finished difference Result 294 states and 411 transitions. [2025-02-07 22:59:54,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 22:59:54,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-02-07 22:59:54,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:54,850 INFO L225 Difference]: With dead ends: 294 [2025-02-07 22:59:54,850 INFO L226 Difference]: Without dead ends: 210 [2025-02-07 22:59:54,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-07 22:59:54,851 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 88 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:54,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 387 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:59:54,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-07 22:59:54,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 182. [2025-02-07 22:59:54,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.3867403314917126) internal successors, (251), 181 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 251 transitions. [2025-02-07 22:59:54,857 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 251 transitions. Word has length 48 [2025-02-07 22:59:54,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:54,857 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 251 transitions. [2025-02-07 22:59:54,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:54,857 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 251 transitions. [2025-02-07 22:59:54,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-07 22:59:54,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:54,858 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 22:59:54,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 22:59:54,858 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:54,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:54,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1893490574, now seen corresponding path program 1 times [2025-02-07 22:59:54,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:59:54,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499879969] [2025-02-07 22:59:54,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:54,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:59:54,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-07 22:59:54,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 22:59:54,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:54,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:55,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:59:55,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499879969] [2025-02-07 22:59:55,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499879969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:59:55,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:59:55,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:59:55,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650126643] [2025-02-07 22:59:55,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:59:55,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:59:55,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:59:55,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:59:55,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:59:55,144 INFO L87 Difference]: Start difference. First operand 182 states and 251 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:55,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:55,250 INFO L93 Difference]: Finished difference Result 274 states and 381 transitions. [2025-02-07 22:59:55,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:59:55,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-02-07 22:59:55,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:55,252 INFO L225 Difference]: With dead ends: 274 [2025-02-07 22:59:55,252 INFO L226 Difference]: Without dead ends: 190 [2025-02-07 22:59:55,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:59:55,253 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 65 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:55,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 221 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:59:55,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-07 22:59:55,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 184. [2025-02-07 22:59:55,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.3825136612021858) internal successors, (253), 183 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:55,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 253 transitions. [2025-02-07 22:59:55,258 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 253 transitions. Word has length 49 [2025-02-07 22:59:55,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:55,258 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 253 transitions. [2025-02-07 22:59:55,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:55,258 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 253 transitions. [2025-02-07 22:59:55,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-07 22:59:55,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:55,259 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 22:59:55,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 22:59:55,259 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:55,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:55,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1422549863, now seen corresponding path program 1 times [2025-02-07 22:59:55,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:59:55,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534435314] [2025-02-07 22:59:55,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:55,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:59:55,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-07 22:59:55,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-07 22:59:55,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:55,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:55,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:59:55,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534435314] [2025-02-07 22:59:55,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534435314] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:59:55,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:59:55,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:59:55,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159808197] [2025-02-07 22:59:55,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:59:55,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:59:55,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:59:55,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:59:55,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:59:55,658 INFO L87 Difference]: Start difference. First operand 184 states and 253 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:55,752 INFO L93 Difference]: Finished difference Result 298 states and 409 transitions. [2025-02-07 22:59:55,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:59:55,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-02-07 22:59:55,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:55,753 INFO L225 Difference]: With dead ends: 298 [2025-02-07 22:59:55,753 INFO L226 Difference]: Without dead ends: 208 [2025-02-07 22:59:55,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-07 22:59:55,754 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 49 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:55,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 264 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:59:55,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-02-07 22:59:55,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 188. [2025-02-07 22:59:55,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.3636363636363635) internal successors, (255), 187 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 255 transitions. [2025-02-07 22:59:55,759 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 255 transitions. Word has length 50 [2025-02-07 22:59:55,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:55,759 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 255 transitions. [2025-02-07 22:59:55,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 255 transitions. [2025-02-07 22:59:55,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-07 22:59:55,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:55,763 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 22:59:55,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 22:59:55,763 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:55,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:55,766 INFO L85 PathProgramCache]: Analyzing trace with hash 258832214, now seen corresponding path program 1 times [2025-02-07 22:59:55,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:59:55,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527381020] [2025-02-07 22:59:55,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:55,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:59:55,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-07 22:59:55,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-07 22:59:55,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:55,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:56,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:56,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:59:56,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527381020] [2025-02-07 22:59:56,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527381020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:59:56,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:59:56,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:59:56,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190207044] [2025-02-07 22:59:56,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:59:56,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:59:56,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:59:56,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:59:56,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:59:56,104 INFO L87 Difference]: Start difference. First operand 188 states and 255 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:56,246 INFO L93 Difference]: Finished difference Result 322 states and 436 transitions. [2025-02-07 22:59:56,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:59:56,246 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-02-07 22:59:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:56,247 INFO L225 Difference]: With dead ends: 322 [2025-02-07 22:59:56,247 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 22:59:56,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:59:56,248 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 57 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:56,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 303 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:59:56,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 22:59:56,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 207. [2025-02-07 22:59:56,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.3592233009708738) internal successors, (280), 206 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 280 transitions. [2025-02-07 22:59:56,253 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 280 transitions. Word has length 50 [2025-02-07 22:59:56,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:56,253 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 280 transitions. [2025-02-07 22:59:56,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:56,253 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 280 transitions. [2025-02-07 22:59:56,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-07 22:59:56,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:56,254 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 22:59:56,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 22:59:56,254 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:59:56,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:59:56,255 INFO L85 PathProgramCache]: Analyzing trace with hash 574497415, now seen corresponding path program 1 times [2025-02-07 22:59:56,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:59:56,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388528986] [2025-02-07 22:59:56,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:56,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:59:56,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-07 22:59:56,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-07 22:59:56,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:56,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:56,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:59:56,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388528986] [2025-02-07 22:59:56,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388528986] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:59:56,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518141307] [2025-02-07 22:59:56,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:59:56,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:59:56,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:59:56,581 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-07 22:59:56,583 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-07 22:59:56,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-07 22:59:56,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-07 22:59:56,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:59:56,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:59:56,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-02-07 22:59:56,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:59:57,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:57,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:59:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:59:58,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518141307] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:59:58,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 22:59:58,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 9] total 27 [2025-02-07 22:59:58,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381894733] [2025-02-07 22:59:58,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 22:59:58,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-07 22:59:58,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:59:58,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-07 22:59:58,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2025-02-07 22:59:58,002 INFO L87 Difference]: Start difference. First operand 207 states and 280 transitions. Second operand has 28 states, 28 states have (on average 5.035714285714286) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:59,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:59:59,815 INFO L93 Difference]: Finished difference Result 591 states and 806 transitions. [2025-02-07 22:59:59,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-07 22:59:59,816 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.035714285714286) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 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 50 [2025-02-07 22:59:59,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:59:59,817 INFO L225 Difference]: With dead ends: 591 [2025-02-07 22:59:59,817 INFO L226 Difference]: Without dead ends: 426 [2025-02-07 22:59:59,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=467, Invalid=2395, Unknown=0, NotChecked=0, Total=2862 [2025-02-07 22:59:59,819 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 1211 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 2653 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 2665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:59:59,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 1415 Invalid, 2665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2653 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-07 22:59:59,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-02-07 22:59:59,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 170. [2025-02-07 22:59:59,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.349112426035503) internal successors, (228), 169 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:59,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 228 transitions. [2025-02-07 22:59:59,824 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 228 transitions. Word has length 50 [2025-02-07 22:59:59,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:59:59,825 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 228 transitions. [2025-02-07 22:59:59,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.035714285714286) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:59:59,825 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 228 transitions. [2025-02-07 22:59:59,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-07 22:59:59,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:59:59,825 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:59:59,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 23:00:00,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:00:00,027 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:00:00,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:00:00,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1109538348, now seen corresponding path program 1 times [2025-02-07 23:00:00,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:00:00,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060914013] [2025-02-07 23:00:00,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:00:00,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:00:00,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-07 23:00:00,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-07 23:00:00,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:00:00,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:00:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:00:00,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:00:00,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060914013] [2025-02-07 23:00:00,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060914013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:00:00,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:00:00,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:00:00,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329584981] [2025-02-07 23:00:00,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:00:00,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:00:00,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:00:00,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:00:00,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:00:00,341 INFO L87 Difference]: Start difference. First operand 170 states and 228 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:00,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:00:00,451 INFO L93 Difference]: Finished difference Result 280 states and 379 transitions. [2025-02-07 23:00:00,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:00:00,451 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-02-07 23:00:00,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:00:00,452 INFO L225 Difference]: With dead ends: 280 [2025-02-07 23:00:00,452 INFO L226 Difference]: Without dead ends: 186 [2025-02-07 23:00:00,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:00:00,453 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 44 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:00:00,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 460 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:00:00,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-07 23:00:00,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 166. [2025-02-07 23:00:00,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.3454545454545455) internal successors, (222), 165 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:00,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 222 transitions. [2025-02-07 23:00:00,457 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 222 transitions. Word has length 51 [2025-02-07 23:00:00,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:00:00,458 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 222 transitions. [2025-02-07 23:00:00,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:00,458 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 222 transitions. [2025-02-07 23:00:00,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-07 23:00:00,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:00:00,459 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:00:00,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 23:00:00,459 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:00:00,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:00:00,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1049223997, now seen corresponding path program 1 times [2025-02-07 23:00:00,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:00:00,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551712906] [2025-02-07 23:00:00,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:00:00,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:00:00,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-07 23:00:00,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-07 23:00:00,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:00:00,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:00:00,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:00:00,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:00:00,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551712906] [2025-02-07 23:00:00,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551712906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:00:00,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:00:00,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:00:00,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209538725] [2025-02-07 23:00:00,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:00:00,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:00:00,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:00:00,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:00:00,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:00:00,859 INFO L87 Difference]: Start difference. First operand 166 states and 222 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:01,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:00:01,097 INFO L93 Difference]: Finished difference Result 270 states and 365 transitions. [2025-02-07 23:00:01,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:00:01,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-02-07 23:00:01,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:00:01,099 INFO L225 Difference]: With dead ends: 270 [2025-02-07 23:00:01,099 INFO L226 Difference]: Without dead ends: 178 [2025-02-07 23:00:01,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:00:01,100 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 42 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:00:01,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 320 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:00:01,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-07 23:00:01,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 172. [2025-02-07 23:00:01,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.345029239766082) internal successors, (230), 171 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 230 transitions. [2025-02-07 23:00:01,107 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 230 transitions. Word has length 51 [2025-02-07 23:00:01,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:00:01,108 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 230 transitions. [2025-02-07 23:00:01,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 230 transitions. [2025-02-07 23:00:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-07 23:00:01,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:00:01,108 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:00:01,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 23:00:01,109 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:00:01,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:00:01,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1488338941, now seen corresponding path program 1 times [2025-02-07 23:00:01,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:00:01,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885840193] [2025-02-07 23:00:01,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:00:01,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:00:01,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-07 23:00:01,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-07 23:00:01,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:00:01,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:00:01,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:00:01,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:00:01,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885840193] [2025-02-07 23:00:01,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885840193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:00:01,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:00:01,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:00:01,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507443999] [2025-02-07 23:00:01,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:00:01,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:00:01,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:00:01,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:00:01,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:00:01,258 INFO L87 Difference]: Start difference. First operand 172 states and 230 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:01,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:00:01,322 INFO L93 Difference]: Finished difference Result 288 states and 389 transitions. [2025-02-07 23:00:01,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:00:01,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-02-07 23:00:01,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:00:01,324 INFO L225 Difference]: With dead ends: 288 [2025-02-07 23:00:01,325 INFO L226 Difference]: Without dead ends: 180 [2025-02-07 23:00:01,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:00:01,325 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 91 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:00:01,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 173 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:00:01,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-07 23:00:01,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-02-07 23:00:01,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.329608938547486) internal successors, (238), 179 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:01,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 238 transitions. [2025-02-07 23:00:01,333 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 238 transitions. Word has length 51 [2025-02-07 23:00:01,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:00:01,333 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 238 transitions. [2025-02-07 23:00:01,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 238 transitions. [2025-02-07 23:00:01,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-07 23:00:01,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:00:01,334 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:00:01,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 23:00:01,334 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:00:01,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:00:01,334 INFO L85 PathProgramCache]: Analyzing trace with hash 89018097, now seen corresponding path program 1 times [2025-02-07 23:00:01,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:00:01,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029924199] [2025-02-07 23:00:01,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:00:01,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:00:01,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-07 23:00:01,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-07 23:00:01,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:00:01,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:00:01,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:00:01,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:00:01,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029924199] [2025-02-07 23:00:01,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029924199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:00:01,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:00:01,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:00:01,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754946374] [2025-02-07 23:00:01,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:00:01,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:00:01,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:00:01,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:00:01,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:00:01,536 INFO L87 Difference]: Start difference. First operand 180 states and 238 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:01,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:00:01,615 INFO L93 Difference]: Finished difference Result 296 states and 391 transitions. [2025-02-07 23:00:01,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:00:01,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-02-07 23:00:01,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:00:01,616 INFO L225 Difference]: With dead ends: 296 [2025-02-07 23:00:01,616 INFO L226 Difference]: Without dead ends: 162 [2025-02-07 23:00:01,616 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-07 23:00:01,617 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 35 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:00:01,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 268 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:00:01,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-07 23:00:01,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 156. [2025-02-07 23:00:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.3161290322580645) internal successors, (204), 155 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 204 transitions. [2025-02-07 23:00:01,622 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 204 transitions. Word has length 52 [2025-02-07 23:00:01,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:00:01,622 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 204 transitions. [2025-02-07 23:00:01,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 204 transitions. [2025-02-07 23:00:01,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-07 23:00:01,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:00:01,623 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:00:01,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 23:00:01,623 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:00:01,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:00:01,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1842578948, now seen corresponding path program 1 times [2025-02-07 23:00:01,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:00:01,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166939144] [2025-02-07 23:00:01,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:00:01,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:00:01,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-07 23:00:01,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-07 23:00:01,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:00:01,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:00:01,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:00:01,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:00:01,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166939144] [2025-02-07 23:00:01,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166939144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:00:01,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:00:01,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:00:01,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980719137] [2025-02-07 23:00:01,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:00:01,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:00:01,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:00:01,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:00:01,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:00:01,976 INFO L87 Difference]: Start difference. First operand 156 states and 204 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:02,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:00:02,092 INFO L93 Difference]: Finished difference Result 264 states and 351 transitions. [2025-02-07 23:00:02,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:00:02,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-02-07 23:00:02,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:00:02,094 INFO L225 Difference]: With dead ends: 264 [2025-02-07 23:00:02,094 INFO L226 Difference]: Without dead ends: 168 [2025-02-07 23:00:02,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:00:02,095 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 25 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:00:02,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 266 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:00:02,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-07 23:00:02,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2025-02-07 23:00:02,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.309090909090909) internal successors, (216), 165 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:02,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 216 transitions. [2025-02-07 23:00:02,103 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 216 transitions. Word has length 52 [2025-02-07 23:00:02,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:00:02,104 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 216 transitions. [2025-02-07 23:00:02,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:02,104 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 216 transitions. [2025-02-07 23:00:02,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-07 23:00:02,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:00:02,105 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:00:02,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 23:00:02,105 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:00:02,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:00:02,106 INFO L85 PathProgramCache]: Analyzing trace with hash 741970150, now seen corresponding path program 1 times [2025-02-07 23:00:02,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:00:02,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622506404] [2025-02-07 23:00:02,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:00:02,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:00:02,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-07 23:00:02,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-07 23:00:02,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:00:02,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:00:02,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:00:02,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:00:02,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622506404] [2025-02-07 23:00:02,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622506404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:00:02,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:00:02,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 23:00:02,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407988725] [2025-02-07 23:00:02,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:00:02,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 23:00:02,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:00:02,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 23:00:02,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:00:02,757 INFO L87 Difference]: Start difference. First operand 166 states and 216 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:00:02,978 INFO L93 Difference]: Finished difference Result 346 states and 454 transitions. [2025-02-07 23:00:02,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 23:00:02,978 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-02-07 23:00:02,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:00:02,980 INFO L225 Difference]: With dead ends: 346 [2025-02-07 23:00:02,980 INFO L226 Difference]: Without dead ends: 179 [2025-02-07 23:00:02,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-02-07 23:00:02,980 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 134 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:00:02,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 507 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:00:02,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-02-07 23:00:02,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2025-02-07 23:00:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.2921348314606742) internal successors, (230), 178 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 230 transitions. [2025-02-07 23:00:02,987 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 230 transitions. Word has length 53 [2025-02-07 23:00:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:00:02,987 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 230 transitions. [2025-02-07 23:00:02,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 230 transitions. [2025-02-07 23:00:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-07 23:00:02,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:00:02,988 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:00:02,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 23:00:02,988 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:00:02,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:00:02,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1889073800, now seen corresponding path program 1 times [2025-02-07 23:00:02,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:00:02,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616101669] [2025-02-07 23:00:02,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:00:02,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:00:03,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-07 23:00:03,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-07 23:00:03,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:00:03,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:00:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:00:03,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:00:03,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616101669] [2025-02-07 23:00:03,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616101669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:00:03,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:00:03,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:00:03,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140541093] [2025-02-07 23:00:03,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:00:03,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:00:03,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:00:03,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:00:03,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:00:03,095 INFO L87 Difference]: Start difference. First operand 179 states and 230 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:03,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:00:03,152 INFO L93 Difference]: Finished difference Result 328 states and 424 transitions. [2025-02-07 23:00:03,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:00:03,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-02-07 23:00:03,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:00:03,153 INFO L225 Difference]: With dead ends: 328 [2025-02-07 23:00:03,154 INFO L226 Difference]: Without dead ends: 183 [2025-02-07 23:00:03,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:00:03,154 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:00:03,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 283 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:00:03,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-07 23:00:03,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-02-07 23:00:03,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.2857142857142858) internal successors, (234), 182 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:03,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 234 transitions. [2025-02-07 23:00:03,158 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 234 transitions. Word has length 54 [2025-02-07 23:00:03,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:00:03,158 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 234 transitions. [2025-02-07 23:00:03,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:03,158 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 234 transitions. [2025-02-07 23:00:03,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-07 23:00:03,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:00:03,159 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:00:03,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 23:00:03,159 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:00:03,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:00:03,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1350299979, now seen corresponding path program 1 times [2025-02-07 23:00:03,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:00:03,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811025036] [2025-02-07 23:00:03,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:00:03,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:00:03,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-07 23:00:03,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-07 23:00:03,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:00:03,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:00:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:00:03,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:00:03,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811025036] [2025-02-07 23:00:03,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811025036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:00:03,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:00:03,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:00:03,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380463663] [2025-02-07 23:00:03,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:00:03,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:00:03,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:00:03,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:00:03,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:00:03,402 INFO L87 Difference]: Start difference. First operand 183 states and 234 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:03,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:00:03,569 INFO L93 Difference]: Finished difference Result 328 states and 420 transitions. [2025-02-07 23:00:03,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:00:03,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-02-07 23:00:03,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:00:03,570 INFO L225 Difference]: With dead ends: 328 [2025-02-07 23:00:03,570 INFO L226 Difference]: Without dead ends: 164 [2025-02-07 23:00:03,570 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-07 23:00:03,571 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 42 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:00:03,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 292 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:00:03,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-07 23:00:03,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-02-07 23:00:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.2822085889570551) internal successors, (209), 163 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-07 23:00:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 209 transitions. [2025-02-07 23:00:03,576 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 209 transitions. Word has length 55 [2025-02-07 23:00:03,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:00:03,576 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 209 transitions. [2025-02-07 23:00:03,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 209 transitions. [2025-02-07 23:00:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-07 23:00:03,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:00:03,576 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:00:03,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 23:00:03,576 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:00:03,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:00:03,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1935305371, now seen corresponding path program 1 times [2025-02-07 23:00:03,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:00:03,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99662338] [2025-02-07 23:00:03,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:00:03,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:00:03,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-07 23:00:03,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-07 23:00:03,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:00:03,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:00:03,638 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 23:00:03,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-07 23:00:03,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-07 23:00:03,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:00:03,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:00:03,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 23:00:03,715 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 23:00:03,715 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 23:00:03,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-07 23:00:03,722 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:00:03,743 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:00:03,743 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:00:03,756 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 23:00:03,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 11:00:03 BoogieIcfgContainer [2025-02-07 23:00:03,762 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 23:00:03,762 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 23:00:03,762 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 23:00:03,762 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 23:00:03,763 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:59:49" (3/4) ... [2025-02-07 23:00:03,764 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 23:00:03,769 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 23:00:03,770 INFO L158 Benchmark]: Toolchain (without parser) took 14767.27ms. Allocated memory was 201.3MB in the beginning and 427.8MB in the end (delta: 226.5MB). Free memory was 158.8MB in the beginning and 176.9MB in the end (delta: -18.1MB). Peak memory consumption was 211.6MB. Max. memory is 16.1GB. [2025-02-07 23:00:03,770 INFO L158 Benchmark]: CDTParser took 1.34ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:00:03,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.86ms. Allocated memory is still 201.3MB. Free memory was 158.8MB in the beginning and 144.5MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 23:00:03,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.68ms. Allocated memory is still 201.3MB. Free memory was 144.5MB in the beginning and 138.6MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:00:03,770 INFO L158 Benchmark]: Boogie Preprocessor took 75.99ms. Allocated memory is still 201.3MB. Free memory was 138.2MB in the beginning and 134.6MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:00:03,770 INFO L158 Benchmark]: IcfgBuilder took 502.57ms. Allocated memory is still 201.3MB. Free memory was 134.6MB in the beginning and 94.6MB in the end (delta: 40.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-07 23:00:03,770 INFO L158 Benchmark]: TraceAbstraction took 13882.11ms. Allocated memory was 201.3MB in the beginning and 427.8MB in the end (delta: 226.5MB). Free memory was 94.2MB in the beginning and 177.0MB in the end (delta: -82.8MB). Peak memory consumption was 144.5MB. Max. memory is 16.1GB. [2025-02-07 23:00:03,770 INFO L158 Benchmark]: Witness Printer took 6.85ms. Allocated memory is still 427.8MB. Free memory was 177.0MB in the beginning and 176.9MB in the end (delta: 87.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:00:03,771 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.34ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.86ms. Allocated memory is still 201.3MB. Free memory was 158.8MB in the beginning and 144.5MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.68ms. Allocated memory is still 201.3MB. Free memory was 144.5MB in the beginning and 138.6MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 75.99ms. Allocated memory is still 201.3MB. Free memory was 138.2MB in the beginning and 134.6MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 502.57ms. Allocated memory is still 201.3MB. Free memory was 134.6MB in the beginning and 94.6MB in the end (delta: 40.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13882.11ms. Allocated memory was 201.3MB in the beginning and 427.8MB in the end (delta: 226.5MB). Free memory was 94.2MB in the beginning and 177.0MB in the end (delta: -82.8MB). Peak memory consumption was 144.5MB. Max. memory is 16.1GB. * Witness Printer took 6.85ms. Allocated memory is still 427.8MB. Free memory was 177.0MB in the beginning and 176.9MB in the end (delta: 87.1kB). 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 shiftRight at line 78, overapproximation of bitwiseOr at line 134, overapproximation of bitwiseAnd at line 135, overapproximation of bitwiseAnd at line 147, overapproximation of bitwiseAnd at line 113. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L32] const SORT_4 var_5 = 0; [L33] const SORT_1 var_14 = 1; [L34] const SORT_4 var_19 = 1; [L35] const SORT_4 var_22 = 15; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_14=1, var_19=1, var_22=15, var_5=0] [L40] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L41] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_14=1, var_19=1, var_22=15, var_5=0] [L41] SORT_4 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L43] SORT_4 init_7_arg_1 = var_5; [L44] state_6 = init_7_arg_1 [L45] SORT_4 init_9_arg_1 = var_5; [L46] state_8 = init_9_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L49] input_2 = __VERIFIER_nondet_uchar() [L50] input_3 = __VERIFIER_nondet_uchar() [L53] SORT_4 var_10_arg_0 = state_6; [L54] SORT_4 var_10_arg_1 = state_8; [L55] SORT_1 var_10 = var_10_arg_0 < var_10_arg_1; [L56] SORT_1 var_11_arg_0 = var_10; [L57] SORT_1 var_11 = ~var_11_arg_0; [L58] SORT_1 var_15_arg_0 = var_11; [L59] SORT_1 var_15 = ~var_15_arg_0; [L60] SORT_1 var_16_arg_0 = var_14; [L61] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_19=1, var_22=15] [L62] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L62] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L63] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L63] var_16 = var_16 & mask_SORT_1 [L64] SORT_1 bad_17_arg_0 = var_16; [L65] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L65] RET __VERIFIER_assert(!(bad_17_arg_0)) [L67] SORT_1 var_31_arg_0 = input_3; [L68] SORT_1 var_31 = ~var_31_arg_0; [L69] SORT_4 var_32_arg_0 = state_6; [L70] SORT_4 var_32_arg_1 = state_8; [L71] SORT_1 var_32 = var_32_arg_0 > var_32_arg_1; [L72] SORT_1 var_33_arg_0 = var_31; [L73] SORT_1 var_33_arg_1 = var_32; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_33_arg_0=-256, var_33_arg_1=0] [L74] EXPR var_33_arg_0 & var_33_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L74] SORT_1 var_33 = var_33_arg_0 & var_33_arg_1; [L75] EXPR var_33 & mask_SORT_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L75] var_33 = var_33 & mask_SORT_1 [L76] SORT_4 var_28_arg_0 = var_22; [L77] SORT_4 var_28_arg_1 = var_19; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_28_arg_0=15, var_28_arg_1=1, var_33=0] [L78] EXPR var_28_arg_0 >> var_28_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_33=0] [L78] SORT_4 var_28 = var_28_arg_0 >> var_28_arg_1; [L79] SORT_4 var_29_arg_0 = state_6; [L80] SORT_4 var_29_arg_1 = var_19; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_28=-255, var_29_arg_0=0, var_29_arg_1=1, var_33=0] [L81] EXPR var_29_arg_0 >> var_29_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_28=-255, var_33=0] [L81] SORT_4 var_29 = var_29_arg_0 >> var_29_arg_1; [L82] SORT_4 var_30_arg_0 = var_28; [L83] SORT_4 var_30_arg_1 = var_29; [L84] SORT_4 var_30 = var_30_arg_0 + var_30_arg_1; [L85] SORT_4 var_26_arg_0 = state_6; [L86] SORT_4 var_26_arg_1 = state_8; [L87] SORT_1 var_26 = var_26_arg_0 < var_26_arg_1; [L88] SORT_4 var_21_arg_0 = state_8; [L89] SORT_4 var_21_arg_1 = state_6; [L90] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L91] SORT_4 var_23_arg_0 = state_6; [L92] SORT_4 var_23_arg_1 = var_22; [L93] SORT_1 var_23 = var_23_arg_0 != var_23_arg_1; [L94] SORT_1 var_24_arg_0 = var_21; [L95] SORT_1 var_24_arg_1 = var_23; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_24_arg_0=1, var_24_arg_1=1, var_26=0, var_30=1, var_33=0] [L96] EXPR var_24_arg_0 | var_24_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_26=0, var_30=1, var_33=0] [L96] SORT_1 var_24 = var_24_arg_0 | var_24_arg_1; [L97] EXPR var_24 & mask_SORT_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_26=0, var_30=1, var_33=0] [L97] var_24 = var_24 & mask_SORT_1 [L98] SORT_4 var_20_arg_0 = state_6; [L99] SORT_4 var_20_arg_1 = var_19; [L100] SORT_4 var_20 = var_20_arg_0 + var_20_arg_1; [L101] SORT_1 var_25_arg_0 = var_24; [L102] SORT_4 var_25_arg_1 = var_20; [L103] SORT_4 var_25_arg_2 = state_8; [L104] SORT_4 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; [L105] SORT_1 var_27_arg_0 = var_26; [L106] SORT_4 var_27_arg_1 = state_6; [L107] SORT_4 var_27_arg_2 = var_25; [L108] SORT_4 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L109] SORT_1 var_34_arg_0 = var_33; [L110] SORT_4 var_34_arg_1 = var_30; [L111] SORT_4 var_34_arg_2 = var_27; [L112] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_34=1] [L113] EXPR var_34 & mask_SORT_4 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L113] var_34 = var_34 & mask_SORT_4 [L114] SORT_4 next_35_arg_1 = var_34; [L115] SORT_1 var_42_arg_0 = input_3; [L116] SORT_1 var_42 = ~var_42_arg_0; [L117] SORT_4 var_43_arg_0 = state_6; [L118] SORT_4 var_43_arg_1 = state_8; [L119] SORT_1 var_43 = var_43_arg_0 > var_43_arg_1; [L120] SORT_1 var_44_arg_0 = var_42; [L121] SORT_1 var_44_arg_1 = var_43; VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_44_arg_0=-256, var_44_arg_1=0] [L122] EXPR var_44_arg_0 & var_44_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L122] SORT_1 var_44 = var_44_arg_0 & var_44_arg_1; [L123] EXPR var_44 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L123] var_44 = var_44 & mask_SORT_1 [L124] SORT_4 var_37_arg_0 = state_6; [L125] SORT_4 var_37_arg_1 = state_8; [L126] SORT_1 var_37 = var_37_arg_0 > var_37_arg_1; [L127] SORT_1 var_38_arg_0 = var_37; [L128] SORT_1 var_38 = ~var_38_arg_0; [L129] SORT_4 var_39_arg_0 = state_6; [L130] SORT_4 var_39_arg_1 = var_22; [L131] SORT_1 var_39 = var_39_arg_0 != var_39_arg_1; [L132] SORT_1 var_40_arg_0 = var_38; [L133] SORT_1 var_40_arg_1 = var_39; VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_40_arg_0=-1, var_40_arg_1=1, var_44=0] [L134] EXPR var_40_arg_0 | var_40_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_44=0] [L134] SORT_1 var_40 = var_40_arg_0 | var_40_arg_1; [L135] EXPR var_40 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_44=0] [L135] var_40 = var_40 & mask_SORT_1 [L136] SORT_4 var_36_arg_0 = state_8; [L137] SORT_4 var_36_arg_1 = var_19; [L138] SORT_4 var_36 = var_36_arg_0 + var_36_arg_1; [L139] SORT_1 var_41_arg_0 = var_40; [L140] SORT_4 var_41_arg_1 = var_36; [L141] SORT_4 var_41_arg_2 = state_6; [L142] SORT_4 var_41 = var_41_arg_0 ? var_41_arg_1 : var_41_arg_2; [L143] SORT_1 var_45_arg_0 = var_44; [L144] SORT_4 var_45_arg_1 = state_8; [L145] SORT_4 var_45_arg_2 = var_41; [L146] SORT_4 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, var_14=1, var_19=1, var_22=15, var_45=1] [L147] EXPR var_45 & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, var_14=1, var_19=1, var_22=15] [L147] var_45 = var_45 & mask_SORT_4 [L148] SORT_4 next_46_arg_1 = var_45; [L150] state_6 = next_35_arg_1 [L151] state_8 = next_46_arg_1 [L49] input_2 = __VERIFIER_nondet_uchar() [L50] input_3 = __VERIFIER_nondet_uchar() [L53] SORT_4 var_10_arg_0 = state_6; [L54] SORT_4 var_10_arg_1 = state_8; [L55] SORT_1 var_10 = var_10_arg_0 < var_10_arg_1; [L56] SORT_1 var_11_arg_0 = var_10; [L57] SORT_1 var_11 = ~var_11_arg_0; [L58] SORT_1 var_15_arg_0 = var_11; [L59] SORT_1 var_15 = ~var_15_arg_0; [L60] SORT_1 var_16_arg_0 = var_14; [L61] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=1, var_14=1, var_16_arg_0=1, var_16_arg_1=-255, var_19=1, var_22=15] [L62] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=1, var_14=1, var_19=1, var_22=15] [L62] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L63] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=1, var_14=1, var_19=1, var_22=15] [L63] var_16 = var_16 & mask_SORT_1 [L64] SORT_1 bad_17_arg_0 = var_16; [L65] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.8s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2217 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2217 mSDsluCounter, 6876 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5544 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5958 IncrementalHoareTripleChecker+Invalid, 5988 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 1332 mSDtfsCounter, 5958 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 365 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=10, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 509 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 1039 NumberOfCodeBlocks, 1039 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1011 ConstructedInterpolants, 0 QuantifiedInterpolants, 5956 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1003 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 106/120 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-07 23:00:03,796 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.diagonal.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 16f8726a4add15d0bf2494bd44888be53eb7bc01110882b6fc03ef148c6d9055 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:00:05,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:00:05,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-07 23:00:05,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:00:05,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:00:05,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:00:05,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:00:05,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:00:05,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:00:05,886 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:00:05,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:00:05,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:00:05,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:00:05,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:00:05,888 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:00:05,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:00:05,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:00:05,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:00:05,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:00:05,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:00:05,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:00:05,889 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 23:00:05,889 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 23:00:05,889 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 23:00:05,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:00:05,889 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:00:05,889 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:00:05,889 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:00:05,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:00:05,889 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:00:05,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:00:05,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:00:05,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:00:05,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:00:05,890 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:00:05,890 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:00:05,890 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 23:00:05,890 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 23:00:05,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:00:05,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:00:05,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:00:05,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:00:05,890 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 -> 16f8726a4add15d0bf2494bd44888be53eb7bc01110882b6fc03ef148c6d9055 [2025-02-07 23:00:06,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:00:06,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:00:06,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:00:06,144 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:00:06,144 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:00:06,145 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.diagonal.c [2025-02-07 23:00:07,362 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/101f77113/0185aea15af64f9fa039e6ea647ed0c9/FLAG59f8891c0 [2025-02-07 23:00:07,554 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:00:07,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c [2025-02-07 23:00:07,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/101f77113/0185aea15af64f9fa039e6ea647ed0c9/FLAG59f8891c0 [2025-02-07 23:00:07,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/101f77113/0185aea15af64f9fa039e6ea647ed0c9 [2025-02-07 23:00:07,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:00:07,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:00:07,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:00:07,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:00:07,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:00:07,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:00:07" (1/1) ... [2025-02-07 23:00:07,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e03d0e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:00:07, skipping insertion in model container [2025-02-07 23:00:07,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:00:07" (1/1) ... [2025-02-07 23:00:07,605 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:00:07,728 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.diagonal.c[1248,1261] [2025-02-07 23:00:07,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:00:07,795 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:00:07,803 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.diagonal.c[1248,1261] [2025-02-07 23:00:07,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:00:07,856 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:00:07,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:00:07 WrapperNode [2025-02-07 23:00:07,857 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:00:07,858 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:00:07,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:00:07,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:00:07,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:00:07" (1/1) ... [2025-02-07 23:00:07,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:00:07" (1/1) ... [2025-02-07 23:00:07,892 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 141 [2025-02-07 23:00:07,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:00:07,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:00:07,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:00:07,896 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:00:07,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:00:07" (1/1) ... [2025-02-07 23:00:07,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:00:07" (1/1) ... [2025-02-07 23:00:07,906 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:00:07" (1/1) ... [2025-02-07 23:00:07,922 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-07 23:00:07,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:00:07" (1/1) ... [2025-02-07 23:00:07,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:00:07" (1/1) ... [2025-02-07 23:00:07,928 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:00:07" (1/1) ... [2025-02-07 23:00:07,929 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:00:07" (1/1) ... [2025-02-07 23:00:07,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:00:07" (1/1) ... [2025-02-07 23:00:07,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:00:07" (1/1) ... [2025-02-07 23:00:07,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:00:07,937 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:00:07,937 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:00:07,937 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:00:07,939 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:00:07" (1/1) ... [2025-02-07 23:00:07,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:00:07,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:00:07,968 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-07 23:00:07,971 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-07 23:00:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:00:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 23:00:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:00:07,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:00:08,057 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:00:08,058 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:00:08,227 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-07 23:00:08,228 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:00:08,234 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:00:08,234 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:00:08,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:00:08 BoogieIcfgContainer [2025-02-07 23:00:08,234 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:00:08,236 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:00:08,236 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:00:08,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:00:08,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:00:07" (1/3) ... [2025-02-07 23:00:08,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c33418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:00:08, skipping insertion in model container [2025-02-07 23:00:08,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:00:07" (2/3) ... [2025-02-07 23:00:08,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c33418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:00:08, skipping insertion in model container [2025-02-07 23:00:08,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:00:08" (3/3) ... [2025-02-07 23:00:08,242 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.diagonal.c [2025-02-07 23:00:08,253 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:00:08,254 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.diagonal.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:00:08,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:00:08,296 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;@55060341, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:00:08,296 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:00:08,299 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-07 23:00:08,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 23:00:08,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:00:08,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 23:00:08,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:00:08,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:00:08,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 23:00:08,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:00:08,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1437847629] [2025-02-07 23:00:08,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:00:08,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:00:08,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:00:08,322 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-07 23:00:08,324 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-07 23:00:08,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 23:00:08,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 23:00:08,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:00:08,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:00:08,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-07 23:00:08,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:00:08,658 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-07 23:00:08,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:00:08,659 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:00:08,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437847629] [2025-02-07 23:00:08,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437847629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:00:08,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:00:08,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:00:08,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849466554] [2025-02-07 23:00:08,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:00:08,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:00:08,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:00:08,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:00:08,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:00:08,677 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-07 23:00:08,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:00:08,705 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-07 23:00:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:00:08,707 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-07 23:00:08,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:00:08,711 INFO L225 Difference]: With dead ends: 16 [2025-02-07 23:00:08,712 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 23:00:08,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:00:08,717 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 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-07 23:00:08,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 23:00:08,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 23:00:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-07 23:00:08,736 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-07 23:00:08,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 23:00:08,740 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 23:00:08,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:00:08,740 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 23:00:08,741 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-07 23:00:08,741 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 23:00:08,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 23:00:08,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:00:08,742 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 23:00:08,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 23:00:08,942 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-07 23:00:08,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:00:08,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:00:08,944 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 23:00:08,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:00:08,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [345483747] [2025-02-07 23:00:08,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:00:08,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:00:08,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:00:08,947 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-07 23:00:08,948 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-07 23:00:09,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 23:00:09,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 23:00:09,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:00:09,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:00:09,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-07 23:00:09,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:00:09,362 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-07 23:00:09,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:00:11,534 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-07 23:00:11,535 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:00:11,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345483747] [2025-02-07 23:00:11,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345483747] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:00:11,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 23:00:11,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-07 23:00:11,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984001698] [2025-02-07 23:00:11,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 23:00:11,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:00:11,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:00:11,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:00:11,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:00:11,537 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:12,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:00:12,067 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2025-02-07 23:00:12,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:00:12,068 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 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-07 23:00:12,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:00:12,068 INFO L225 Difference]: With dead ends: 20 [2025-02-07 23:00:12,068 INFO L226 Difference]: Without dead ends: 18 [2025-02-07 23:00:12,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:00:12,069 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:00:12,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 11 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:00:12,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-07 23:00:12,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2025-02-07 23:00:12,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2025-02-07 23:00:12,072 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 7 [2025-02-07 23:00:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:00:12,073 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2025-02-07 23:00:12,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:00:12,073 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2025-02-07 23:00:12,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-07 23:00:12,073 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:00:12,073 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2025-02-07 23:00:12,079 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-07 23:00:12,274 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-07 23:00:12,274 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:00:12,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:00:12,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1174864737, now seen corresponding path program 2 times [2025-02-07 23:00:12,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:00:12,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [610080311] [2025-02-07 23:00:12,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 23:00:12,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:00:12,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:00:12,280 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-07 23:00:12,284 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-07 23:00:12,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-07 23:00:12,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-07 23:00:12,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 23:00:12,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:00:12,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-07 23:00:12,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:00:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:00:12,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:00:38,711 WARN L286 SmtUtils]: Spent 5.33s on a formula simplification. DAG size of input: 1437 DAG size of output: 1271 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)