./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.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.factorial4even.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 a9bfc0bfd402f01a909df8198af653a6c40e8b771ded2d89ed782f9da2aa5bbb --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:05:14,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:05:14,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 23:05:14,637 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:05:14,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:05:14,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:05:14,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:05:14,661 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:05:14,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:05:14,661 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:05:14,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:05:14,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:05:14,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:05:14,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:05:14,663 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:05:14,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:05:14,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:05:14,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:05:14,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:05:14,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:05:14,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:05:14,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:05:14,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:05:14,664 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:05:14,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:05:14,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:05:14,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:05:14,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:05:14,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:05:14,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:05:14,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:05:14,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:05:14,665 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:05:14,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:05:14,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:05:14,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:05:14,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:05:14,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:05:14,666 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:05:14,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:05:14,666 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 -> a9bfc0bfd402f01a909df8198af653a6c40e8b771ded2d89ed782f9da2aa5bbb [2025-02-07 23:05:14,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:05:14,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:05:14,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:05:14,912 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:05:14,913 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:05:14,914 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.factorial4even.c [2025-02-07 23:05:16,111 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb01c313c/193fd100bb234879aaf9d5e8756f2ddc/FLAGc191f9eca [2025-02-07 23:05:16,322 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:05:16,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2025-02-07 23:05:16,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb01c313c/193fd100bb234879aaf9d5e8756f2ddc/FLAGc191f9eca [2025-02-07 23:05:16,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb01c313c/193fd100bb234879aaf9d5e8756f2ddc [2025-02-07 23:05:16,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:05:16,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:05:16,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:05:16,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:05:16,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:05:16,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:05:16" (1/1) ... [2025-02-07 23:05:16,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5cbe53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:05:16, skipping insertion in model container [2025-02-07 23:05:16,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:05:16" (1/1) ... [2025-02-07 23:05:16,399 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:05:16,509 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.factorial4even.c[1439,1452] [2025-02-07 23:05:16,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:05:16,545 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:05:16,555 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.factorial4even.c[1439,1452] [2025-02-07 23:05:16,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:05:16,585 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:05:16,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:05:16 WrapperNode [2025-02-07 23:05:16,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:05:16,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:05:16,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:05:16,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:05:16,592 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:05:16" (1/1) ... [2025-02-07 23:05:16,597 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:05:16" (1/1) ... [2025-02-07 23:05:16,625 INFO L138 Inliner]: procedures = 17, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 97 [2025-02-07 23:05:16,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:05:16,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:05:16,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:05:16,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:05:16,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:05:16" (1/1) ... [2025-02-07 23:05:16,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:05:16" (1/1) ... [2025-02-07 23:05:16,641 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:05:16" (1/1) ... [2025-02-07 23:05:16,653 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:05:16,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:05:16" (1/1) ... [2025-02-07 23:05:16,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:05:16" (1/1) ... [2025-02-07 23:05:16,658 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:05:16" (1/1) ... [2025-02-07 23:05:16,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:05:16" (1/1) ... [2025-02-07 23:05:16,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:05:16" (1/1) ... [2025-02-07 23:05:16,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:05:16" (1/1) ... [2025-02-07 23:05:16,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:05:16,664 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:05:16,664 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:05:16,664 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:05:16,665 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:05:16" (1/1) ... [2025-02-07 23:05:16,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:05:16,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:05:16,701 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:05:16,703 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:05:16,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:05:16,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:05:16,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:05:16,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:05:16,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-07 23:05:16,721 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-07 23:05:16,765 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:05:16,766 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:05:16,963 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2025-02-07 23:05:16,964 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:05:16,981 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:05:16,982 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:05:16,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:05:16 BoogieIcfgContainer [2025-02-07 23:05:16,982 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:05:16,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:05:16,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:05:16,988 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:05:16,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:05:16" (1/3) ... [2025-02-07 23:05:16,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662a0560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:05:16, skipping insertion in model container [2025-02-07 23:05:16,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:05:16" (2/3) ... [2025-02-07 23:05:16,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662a0560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:05:16, skipping insertion in model container [2025-02-07 23:05:16,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:05:16" (3/3) ... [2025-02-07 23:05:16,992 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.factorial4even.c [2025-02-07 23:05:17,003 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:05:17,004 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.factorial4even.c that has 2 procedures, 34 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:05:17,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:05:17,056 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;@af9cdf2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:05:17,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:05:17,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:05:17,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 23:05:17,064 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:05:17,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:05:17,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:05:17,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:05:17,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1095594129, now seen corresponding path program 1 times [2025-02-07 23:05:17,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:05:17,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196989429] [2025-02-07 23:05:17,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:05:17,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:05:17,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 23:05:17,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 23:05:17,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:05:17,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:05:17,541 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:05:17,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:05:17,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196989429] [2025-02-07 23:05:17,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196989429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:05:17,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:05:17,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:05:17,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176737197] [2025-02-07 23:05:17,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:05:17,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:05:17,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:05:17,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:05:17,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:05:17,561 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:05:17,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:05:17,718 INFO L93 Difference]: Finished difference Result 78 states and 112 transitions. [2025-02-07 23:05:17,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:05:17,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-07 23:05:17,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:05:17,723 INFO L225 Difference]: With dead ends: 78 [2025-02-07 23:05:17,724 INFO L226 Difference]: Without dead ends: 53 [2025-02-07 23:05:17,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:05:17,727 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 93 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:05:17,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 152 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:05:17,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-07 23:05:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 38. [2025-02-07 23:05:17,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 23:05:17,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2025-02-07 23:05:17,753 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 10 [2025-02-07 23:05:17,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:05:17,754 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2025-02-07 23:05:17,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:05:17,755 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2025-02-07 23:05:17,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-07 23:05:17,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:05:17,756 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:05:17,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 23:05:17,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:05:17,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:05:17,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1671991151, now seen corresponding path program 1 times [2025-02-07 23:05:17,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:05:17,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803880340] [2025-02-07 23:05:17,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:05:17,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:05:17,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-07 23:05:17,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 23:05:17,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:05:17,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:05:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:05:17,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:05:17,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803880340] [2025-02-07 23:05:17,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803880340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:05:17,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:05:17,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:05:17,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166026921] [2025-02-07 23:05:17,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:05:17,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:05:17,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:05:17,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:05:17,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:05:17,889 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 23:05:17,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:05:17,946 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2025-02-07 23:05:17,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:05:17,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-02-07 23:05:17,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:05:17,949 INFO L225 Difference]: With dead ends: 51 [2025-02-07 23:05:17,949 INFO L226 Difference]: Without dead ends: 49 [2025-02-07 23:05:17,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:05:17,949 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 23:05:17,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 174 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 23:05:17,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-07 23:05:17,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2025-02-07 23:05:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 23:05:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2025-02-07 23:05:17,960 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 20 [2025-02-07 23:05:17,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:05:17,961 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2025-02-07 23:05:17,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 23:05:17,961 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2025-02-07 23:05:17,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-07 23:05:17,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:05:17,962 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:05:17,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 23:05:17,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:05:17,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:05:17,963 INFO L85 PathProgramCache]: Analyzing trace with hash -128264458, now seen corresponding path program 1 times [2025-02-07 23:05:17,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:05:17,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253230208] [2025-02-07 23:05:17,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:05:17,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:05:17,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-07 23:05:17,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-07 23:05:17,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:05:17,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:05:18,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:05:18,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:05:18,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253230208] [2025-02-07 23:05:18,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253230208] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:05:18,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:05:18,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:05:18,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988921784] [2025-02-07 23:05:18,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:05:18,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:05:18,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:05:18,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:05:18,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:05:18,032 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 23:05:18,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:05:18,063 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2025-02-07 23:05:18,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:05:18,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-02-07 23:05:18,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:05:18,064 INFO L225 Difference]: With dead ends: 75 [2025-02-07 23:05:18,064 INFO L226 Difference]: Without dead ends: 46 [2025-02-07 23:05:18,064 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 23:05:18,065 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 23:05:18,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 23:05:18,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-07 23:05:18,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-07 23:05:18,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 40 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 23:05:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2025-02-07 23:05:18,086 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 21 [2025-02-07 23:05:18,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:05:18,086 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2025-02-07 23:05:18,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 23:05:18,086 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2025-02-07 23:05:18,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 23:05:18,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:05:18,087 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:05:18,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:05:18,087 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:05:18,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:05:18,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1035420268, now seen corresponding path program 1 times [2025-02-07 23:05:18,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:05:18,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624394495] [2025-02-07 23:05:18,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:05:18,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:05:18,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 23:05:18,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 23:05:18,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:05:18,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:05:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:05:18,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:05:18,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624394495] [2025-02-07 23:05:18,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624394495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:05:18,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:05:18,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:05:18,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279899157] [2025-02-07 23:05:18,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:05:18,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:05:18,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:05:18,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:05:18,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:05:18,338 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 23:05:18,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:05:18,438 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2025-02-07 23:05:18,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:05:18,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-02-07 23:05:18,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:05:18,439 INFO L225 Difference]: With dead ends: 88 [2025-02-07 23:05:18,439 INFO L226 Difference]: Without dead ends: 57 [2025-02-07 23:05:18,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:05:18,440 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 54 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:05:18,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 125 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:05:18,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-07 23:05:18,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2025-02-07 23:05:18,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.275) internal successors, (51), 41 states have internal predecessors, (51), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 23:05:18,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2025-02-07 23:05:18,448 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 22 [2025-02-07 23:05:18,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:05:18,448 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2025-02-07 23:05:18,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 23:05:18,448 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2025-02-07 23:05:18,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-07 23:05:18,449 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:05:18,449 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:05:18,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 23:05:18,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:05:18,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:05:18,449 INFO L85 PathProgramCache]: Analyzing trace with hash -602356180, now seen corresponding path program 1 times [2025-02-07 23:05:18,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:05:18,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222143326] [2025-02-07 23:05:18,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:05:18,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:05:18,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-07 23:05:18,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 23:05:18,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:05:18,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:05:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:05:18,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:05:18,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222143326] [2025-02-07 23:05:18,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222143326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:05:18,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:05:18,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:05:18,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507440819] [2025-02-07 23:05:18,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:05:18,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:05:18,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:05:18,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:05:18,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:05:18,703 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:05:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:05:18,802 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2025-02-07 23:05:18,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:05:18,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-02-07 23:05:18,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:05:18,804 INFO L225 Difference]: With dead ends: 88 [2025-02-07 23:05:18,804 INFO L226 Difference]: Without dead ends: 57 [2025-02-07 23:05:18,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:05:18,804 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 43 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:05:18,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 57 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:05:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-07 23:05:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2025-02-07 23:05:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 46 states have internal predecessors, (56), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 23:05:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2025-02-07 23:05:18,816 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 29 [2025-02-07 23:05:18,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:05:18,816 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2025-02-07 23:05:18,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:05:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2025-02-07 23:05:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-07 23:05:18,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:05:18,817 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:05:18,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 23:05:18,818 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:05:18,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:05:18,818 INFO L85 PathProgramCache]: Analyzing trace with hash -332743590, now seen corresponding path program 1 times [2025-02-07 23:05:18,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:05:18,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83460267] [2025-02-07 23:05:18,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:05:18,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:05:18,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-07 23:05:18,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-07 23:05:18,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:05:18,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:05:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:05:18,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:05:18,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83460267] [2025-02-07 23:05:18,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83460267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:05:18,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:05:18,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:05:18,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004902755] [2025-02-07 23:05:18,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:05:18,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:05:18,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:05:18,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:05:18,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:05:18,926 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:05:19,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:05:19,027 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2025-02-07 23:05:19,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:05:19,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-02-07 23:05:19,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:05:19,028 INFO L225 Difference]: With dead ends: 88 [2025-02-07 23:05:19,028 INFO L226 Difference]: Without dead ends: 57 [2025-02-07 23:05:19,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:05:19,029 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 46 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:05:19,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 64 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:05:19,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-07 23:05:19,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2025-02-07 23:05:19,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 47 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 23:05:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2025-02-07 23:05:19,037 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 30 [2025-02-07 23:05:19,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:05:19,037 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2025-02-07 23:05:19,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:05:19,038 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2025-02-07 23:05:19,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-07 23:05:19,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:05:19,040 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:05:19,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 23:05:19,040 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:05:19,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:05:19,041 INFO L85 PathProgramCache]: Analyzing trace with hash 37713571, now seen corresponding path program 1 times [2025-02-07 23:05:19,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:05:19,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898026163] [2025-02-07 23:05:19,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:05:19,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:05:19,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 23:05:19,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 23:05:19,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:05:19,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:05:19,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:05:19,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:05:19,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898026163] [2025-02-07 23:05:19,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898026163] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:05:19,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096267025] [2025-02-07 23:05:19,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:05:19,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:05:19,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:05:19,356 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:05:19,359 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:05:19,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 23:05:19,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 23:05:19,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:05:19,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:05:19,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-07 23:05:19,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:05:19,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 23:05:19,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:05:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 23:05:20,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096267025] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:05:20,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 23:05:20,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 16] total 33 [2025-02-07 23:05:20,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916165953] [2025-02-07 23:05:20,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 23:05:20,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-07 23:05:20,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:05:20,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-07 23:05:20,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=920, Unknown=0, NotChecked=0, Total=1056 [2025-02-07 23:05:20,603 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 33 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 32 states have internal predecessors, (64), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-07 23:05:21,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:05:21,184 INFO L93 Difference]: Finished difference Result 137 states and 174 transitions. [2025-02-07 23:05:21,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-07 23:05:21,185 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 32 states have internal predecessors, (64), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 31 [2025-02-07 23:05:21,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:05:21,186 INFO L225 Difference]: With dead ends: 137 [2025-02-07 23:05:21,186 INFO L226 Difference]: Without dead ends: 106 [2025-02-07 23:05:21,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=359, Invalid=1711, Unknown=0, NotChecked=0, Total=2070 [2025-02-07 23:05:21,189 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 306 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:05:21,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 249 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:05:21,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-07 23:05:21,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 84. [2025-02-07 23:05:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 73 states have internal predecessors, (86), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 23:05:21,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2025-02-07 23:05:21,218 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 31 [2025-02-07 23:05:21,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:05:21,218 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2025-02-07 23:05:21,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 32 states have internal predecessors, (64), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-07 23:05:21,221 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2025-02-07 23:05:21,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-07 23:05:21,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:05:21,222 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:05:21,229 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:05:21,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:05:21,423 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:05:21,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:05:21,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1019149216, now seen corresponding path program 1 times [2025-02-07 23:05:21,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:05:21,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347996337] [2025-02-07 23:05:21,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:05:21,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:05:21,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 23:05:21,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 23:05:21,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:05:21,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:05:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 23:05:21,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:05:21,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347996337] [2025-02-07 23:05:21,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347996337] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:05:21,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154868295] [2025-02-07 23:05:21,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:05:21,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:05:21,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:05:21,775 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:05:21,776 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:05:21,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 23:05:21,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 23:05:21,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:05:21,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:05:21,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-02-07 23:05:21,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:05:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 23:05:22,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:05:22,940 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-07 23:05:22,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154868295] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:05:22,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 23:05:22,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 16] total 35 [2025-02-07 23:05:22,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252982862] [2025-02-07 23:05:22,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 23:05:22,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-07 23:05:22,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:05:22,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-07 23:05:22,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2025-02-07 23:05:22,943 INFO L87 Difference]: Start difference. First operand 84 states and 104 transitions. Second operand has 35 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 34 states have internal predecessors, (79), 9 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-07 23:05:23,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:05:23,739 INFO L93 Difference]: Finished difference Result 149 states and 184 transitions. [2025-02-07 23:05:23,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-07 23:05:23,740 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 34 states have internal predecessors, (79), 9 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) Word has length 43 [2025-02-07 23:05:23,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:05:23,741 INFO L225 Difference]: With dead ends: 149 [2025-02-07 23:05:23,741 INFO L226 Difference]: Without dead ends: 90 [2025-02-07 23:05:23,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=429, Invalid=2121, Unknown=0, NotChecked=0, Total=2550 [2025-02-07 23:05:23,742 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 201 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:05:23,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 160 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:05:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-07 23:05:23,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2025-02-07 23:05:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-07 23:05:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2025-02-07 23:05:23,750 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 43 [2025-02-07 23:05:23,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:05:23,750 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2025-02-07 23:05:23,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 34 states have internal predecessors, (79), 9 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-07 23:05:23,750 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2025-02-07 23:05:23,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-07 23:05:23,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:05:23,751 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:05:23,758 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:05:23,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:05:23,952 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:05:23,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:05:23,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2084453158, now seen corresponding path program 1 times [2025-02-07 23:05:23,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:05:23,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002972985] [2025-02-07 23:05:23,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:05:23,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:05:23,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-07 23:05:23,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-07 23:05:23,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:05:23,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:05:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 20 proven. 35 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 23:05:24,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:05:24,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002972985] [2025-02-07 23:05:24,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002972985] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:05:24,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805869586] [2025-02-07 23:05:24,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:05:24,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:05:24,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:05:24,513 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:05:24,516 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:05:24,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-07 23:05:24,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-07 23:05:24,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:05:24,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:05:24,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-02-07 23:05:24,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:05:25,458 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 35 proven. 44 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-07 23:05:25,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:05:46,623 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-07 23:05:46,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805869586] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:05:46,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 23:05:46,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 21] total 44 [2025-02-07 23:05:46,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128950801] [2025-02-07 23:05:46,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 23:05:46,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-07 23:05:46,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:05:46,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-07 23:05:46,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1622, Unknown=0, NotChecked=0, Total=1892 [2025-02-07 23:05:46,626 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 44 states, 42 states have (on average 2.880952380952381) internal successors, (121), 44 states have internal predecessors, (121), 14 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 12 states have call predecessors, (18), 13 states have call successors, (18) [2025-02-07 23:05:48,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:05:48,494 INFO L93 Difference]: Finished difference Result 188 states and 234 transitions. [2025-02-07 23:05:48,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-07 23:05:48,495 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 2.880952380952381) internal successors, (121), 44 states have internal predecessors, (121), 14 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 12 states have call predecessors, (18), 13 states have call successors, (18) Word has length 72 [2025-02-07 23:05:48,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:05:48,496 INFO L225 Difference]: With dead ends: 188 [2025-02-07 23:05:48,496 INFO L226 Difference]: Without dead ends: 135 [2025-02-07 23:05:48,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1305 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=778, Invalid=3778, Unknown=0, NotChecked=0, Total=4556 [2025-02-07 23:05:48,497 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 238 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 23:05:48,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 309 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 23:05:48,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-07 23:05:48,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 127. [2025-02-07 23:05:48,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 107 states have (on average 1.1962616822429906) internal successors, (128), 110 states have internal predecessors, (128), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-07 23:05:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 158 transitions. [2025-02-07 23:05:48,512 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 158 transitions. Word has length 72 [2025-02-07 23:05:48,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:05:48,512 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 158 transitions. [2025-02-07 23:05:48,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 2.880952380952381) internal successors, (121), 44 states have internal predecessors, (121), 14 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 12 states have call predecessors, (18), 13 states have call successors, (18) [2025-02-07 23:05:48,512 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 158 transitions. [2025-02-07 23:05:48,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-07 23:05:48,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:05:48,513 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:05:48,519 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:05:48,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:05:48,714 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:05:48,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:05:48,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1569291811, now seen corresponding path program 2 times [2025-02-07 23:05:48,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:05:48,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534702759] [2025-02-07 23:05:48,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 23:05:48,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:05:48,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-07 23:05:48,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-02-07 23:05:48,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 23:05:48,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:05:49,498 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 23:05:49,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:05:49,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534702759] [2025-02-07 23:05:49,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534702759] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:05:49,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621353217] [2025-02-07 23:05:49,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 23:05:49,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:05:49,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:05:49,500 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 23:05:49,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 23:05:49,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-07 23:05:49,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-02-07 23:05:49,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 23:05:49,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:05:49,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 119 conjuncts are in the unsatisfiable core [2025-02-07 23:05:49,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:05:50,442 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 19 proven. 62 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-07 23:05:50,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:05:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 30 proven. 50 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-07 23:05:53,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621353217] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:05:53,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 23:05:53,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 24, 24] total 58 [2025-02-07 23:05:53,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728031464] [2025-02-07 23:05:53,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 23:05:53,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-02-07 23:05:53,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:05:53,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-02-07 23:05:53,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=2870, Unknown=0, NotChecked=0, Total=3306 [2025-02-07 23:05:53,722 INFO L87 Difference]: Start difference. First operand 127 states and 158 transitions. Second operand has 58 states, 51 states have (on average 2.549019607843137) internal successors, (130), 55 states have internal predecessors, (130), 16 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 12 states have call predecessors, (18), 13 states have call successors, (18) [2025-02-07 23:05:54,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:05:54,850 INFO L93 Difference]: Finished difference Result 255 states and 320 transitions. [2025-02-07 23:05:54,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-07 23:05:54,851 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 51 states have (on average 2.549019607843137) internal successors, (130), 55 states have internal predecessors, (130), 16 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 12 states have call predecessors, (18), 13 states have call successors, (18) Word has length 73 [2025-02-07 23:05:54,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:05:54,852 INFO L225 Difference]: With dead ends: 255 [2025-02-07 23:05:54,852 INFO L226 Difference]: Without dead ends: 153 [2025-02-07 23:05:54,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1679 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1145, Invalid=4861, Unknown=0, NotChecked=0, Total=6006 [2025-02-07 23:05:54,853 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 626 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:05:54,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 280 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:05:54,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-07 23:05:54,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2025-02-07 23:05:54,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.1607142857142858) internal successors, (130), 116 states have internal predecessors, (130), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 12 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-07 23:05:54,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 162 transitions. [2025-02-07 23:05:54,865 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 162 transitions. Word has length 73 [2025-02-07 23:05:54,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:05:54,865 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 162 transitions. [2025-02-07 23:05:54,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 51 states have (on average 2.549019607843137) internal successors, (130), 55 states have internal predecessors, (130), 16 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 12 states have call predecessors, (18), 13 states have call successors, (18) [2025-02-07 23:05:54,865 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 162 transitions. [2025-02-07 23:05:54,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-07 23:05:54,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:05:54,865 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:05:54,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 23:05:55,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-07 23:05:55,066 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:05:55,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:05:55,066 INFO L85 PathProgramCache]: Analyzing trace with hash -809909472, now seen corresponding path program 2 times [2025-02-07 23:05:55,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:05:55,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987387854] [2025-02-07 23:05:55,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 23:05:55,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:05:55,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-02-07 23:05:55,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-02-07 23:05:55,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 23:05:55,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 23:05:55,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1571247723] [2025-02-07 23:05:55,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 23:05:55,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:05:55,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:05:55,138 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 23:05:55,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 23:05:55,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-02-07 23:05:55,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-02-07 23:05:55,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 23:05:55,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:05:55,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 137 conjuncts are in the unsatisfiable core [2025-02-07 23:05:55,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:05:57,192 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 50 proven. 57 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-07 23:05:57,192 INFO L312 TraceCheckSpWp]: Computing backward predicates...