./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/loop-invgen/heapsort.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:57:45,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:57:45,837 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:57:45,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:57:45,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:57:45,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:57:45,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:57:45,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:57:45,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:57:45,863 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:57:45,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:57:45,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:57:45,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:57:45,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:57:45,864 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:57:45,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:57:45,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:57:45,865 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:57:45,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:57:45,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:57:45,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:57:45,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:57:45,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:57:45,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:57:45,866 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:57:45,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:57:45,866 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:57:45,866 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:57:45,866 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:57:45,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:57:45,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:57:45,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:57:45,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:57:45,867 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:57:45,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:57:45,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:57:45,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:57:45,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:57:45,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:57:45,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:57:45,867 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:57:45,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:57:45,867 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:57:45,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:57:45,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:57:45,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:57:45,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:57:45,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:57:45,868 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 [2025-01-09 02:57:46,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:57:46,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:57:46,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:57:46,067 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:57:46,067 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:57:46,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/heapsort.i [2025-01-09 02:57:47,156 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c0a14a33/b26a6376d10247109f5d93ab617b40f4/FLAG97a923832 [2025-01-09 02:57:47,365 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:57:47,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2025-01-09 02:57:47,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c0a14a33/b26a6376d10247109f5d93ab617b40f4/FLAG97a923832 [2025-01-09 02:57:47,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c0a14a33/b26a6376d10247109f5d93ab617b40f4 [2025-01-09 02:57:47,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:57:47,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:57:47,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:57:47,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:57:47,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:57:47,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:57:47" (1/1) ... [2025-01-09 02:57:47,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9497a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:47, skipping insertion in model container [2025-01-09 02:57:47,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:57:47" (1/1) ... [2025-01-09 02:57:47,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:57:47,835 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/loop-invgen/heapsort.i[893,906] [2025-01-09 02:57:47,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:57:47,862 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:57:47,870 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/loop-invgen/heapsort.i[893,906] [2025-01-09 02:57:47,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:57:47,891 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:57:47,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:47 WrapperNode [2025-01-09 02:57:47,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:57:47,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:57:47,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:57:47,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:57:47,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:47" (1/1) ... [2025-01-09 02:57:47,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:47" (1/1) ... [2025-01-09 02:57:47,918 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 72 [2025-01-09 02:57:47,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:57:47,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:57:47,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:57:47,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:57:47,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:47" (1/1) ... [2025-01-09 02:57:47,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:47" (1/1) ... [2025-01-09 02:57:47,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:47" (1/1) ... [2025-01-09 02:57:47,941 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-01-09 02:57:47,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:47" (1/1) ... [2025-01-09 02:57:47,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:47" (1/1) ... [2025-01-09 02:57:47,944 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:47" (1/1) ... [2025-01-09 02:57:47,945 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:47" (1/1) ... [2025-01-09 02:57:47,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:47" (1/1) ... [2025-01-09 02:57:47,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:47" (1/1) ... [2025-01-09 02:57:47,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:47" (1/1) ... [2025-01-09 02:57:47,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:57:47,952 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:57:47,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:57:47,952 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:57:47,952 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:47" (1/1) ... [2025-01-09 02:57:47,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:57:47,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:57:47,975 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-01-09 02:57:47,977 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-01-09 02:57:47,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:57:47,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:57:47,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:57:47,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:57:47,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 02:57:47,998 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 02:57:48,035 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:57:48,036 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:57:48,132 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 02:57:48,132 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:57:48,138 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:57:48,138 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 02:57:48,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:57:48 BoogieIcfgContainer [2025-01-09 02:57:48,138 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:57:48,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:57:48,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:57:48,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:57:48,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:57:47" (1/3) ... [2025-01-09 02:57:48,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@574cbf54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:57:48, skipping insertion in model container [2025-01-09 02:57:48,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:47" (2/3) ... [2025-01-09 02:57:48,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@574cbf54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:57:48, skipping insertion in model container [2025-01-09 02:57:48,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:57:48" (3/3) ... [2025-01-09 02:57:48,146 INFO L128 eAbstractionObserver]: Analyzing ICFG heapsort.i [2025-01-09 02:57:48,156 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:57:48,157 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG heapsort.i that has 2 procedures, 38 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 02:57:48,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:57:48,206 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;@6911e3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:57:48,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:57:48,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 02:57:48,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 02:57:48,216 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:48,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:48,217 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:57:48,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:48,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1219257455, now seen corresponding path program 1 times [2025-01-09 02:57:48,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:48,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702542592] [2025-01-09 02:57:48,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:48,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:48,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 02:57:48,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 02:57:48,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:48,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:48,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:48,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702542592] [2025-01-09 02:57:48,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702542592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:48,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:48,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:57:48,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645543520] [2025-01-09 02:57:48,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:48,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:57:48,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:48,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:57:48,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:57:48,510 INFO L87 Difference]: Start difference. First operand has 38 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-01-09 02:57:48,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:48,612 INFO L93 Difference]: Finished difference Result 99 states and 183 transitions. [2025-01-09 02:57:48,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:57:48,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 11 [2025-01-09 02:57:48,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:48,620 INFO L225 Difference]: With dead ends: 99 [2025-01-09 02:57:48,621 INFO L226 Difference]: Without dead ends: 61 [2025-01-09 02:57:48,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:57:48,626 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 19 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:48,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 181 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:57:48,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-09 02:57:48,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2025-01-09 02:57:48,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 02:57:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2025-01-09 02:57:48,659 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 11 [2025-01-09 02:57:48,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:48,659 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 57 transitions. [2025-01-09 02:57:48,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-01-09 02:57:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2025-01-09 02:57:48,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 02:57:48,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:48,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:48,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:57:48,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:57:48,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:48,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1214520686, now seen corresponding path program 1 times [2025-01-09 02:57:48,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:48,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243208750] [2025-01-09 02:57:48,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:48,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:48,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 02:57:48,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 02:57:48,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:48,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:48,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:48,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:48,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243208750] [2025-01-09 02:57:48,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243208750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:48,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:48,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:57:48,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840357201] [2025-01-09 02:57:48,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:48,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:57:48,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:48,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:57:48,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:57:48,734 INFO L87 Difference]: Start difference. First operand 39 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-01-09 02:57:48,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:48,808 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2025-01-09 02:57:48,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:57:48,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 11 [2025-01-09 02:57:48,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:48,809 INFO L225 Difference]: With dead ends: 46 [2025-01-09 02:57:48,809 INFO L226 Difference]: Without dead ends: 44 [2025-01-09 02:57:48,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:57:48,809 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:48,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 143 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:57:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-09 02:57:48,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2025-01-09 02:57:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 02:57:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2025-01-09 02:57:48,819 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 11 [2025-01-09 02:57:48,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:48,819 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2025-01-09 02:57:48,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-01-09 02:57:48,819 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2025-01-09 02:57:48,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 02:57:48,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:48,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:48,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:57:48,821 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:57:48,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:48,821 INFO L85 PathProgramCache]: Analyzing trace with hash 2140749097, now seen corresponding path program 1 times [2025-01-09 02:57:48,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:48,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453009191] [2025-01-09 02:57:48,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:48,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:48,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 02:57:48,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 02:57:48,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:48,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:48,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:48,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:48,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453009191] [2025-01-09 02:57:48,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453009191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:48,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:48,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 02:57:48,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569892698] [2025-01-09 02:57:48,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:48,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 02:57:48,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:48,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 02:57:48,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:57:48,916 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-01-09 02:57:49,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:49,070 INFO L93 Difference]: Finished difference Result 76 states and 111 transitions. [2025-01-09 02:57:49,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 02:57:49,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 11 [2025-01-09 02:57:49,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:49,073 INFO L225 Difference]: With dead ends: 76 [2025-01-09 02:57:49,074 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 02:57:49,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 02:57:49,075 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 31 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:49,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 248 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:57:49,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 02:57:49,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2025-01-09 02:57:49,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 02:57:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2025-01-09 02:57:49,088 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 11 [2025-01-09 02:57:49,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:49,088 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2025-01-09 02:57:49,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-01-09 02:57:49,088 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2025-01-09 02:57:49,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 02:57:49,088 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:49,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:49,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:57:49,089 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:57:49,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:49,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2128504996, now seen corresponding path program 1 times [2025-01-09 02:57:49,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:49,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067033878] [2025-01-09 02:57:49,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:49,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:49,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 02:57:49,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 02:57:49,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:49,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:49,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:49,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:49,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067033878] [2025-01-09 02:57:49,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067033878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:49,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:49,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 02:57:49,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920173070] [2025-01-09 02:57:49,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:49,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 02:57:49,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:49,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 02:57:49,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:57:49,187 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-01-09 02:57:49,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:49,322 INFO L93 Difference]: Finished difference Result 122 states and 186 transitions. [2025-01-09 02:57:49,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 02:57:49,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 11 [2025-01-09 02:57:49,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:49,324 INFO L225 Difference]: With dead ends: 122 [2025-01-09 02:57:49,325 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 02:57:49,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 02:57:49,326 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 29 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:49,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 199 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:57:49,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 02:57:49,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 90. [2025-01-09 02:57:49,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 02:57:49,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 136 transitions. [2025-01-09 02:57:49,350 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 136 transitions. Word has length 11 [2025-01-09 02:57:49,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:49,350 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 136 transitions. [2025-01-09 02:57:49,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-01-09 02:57:49,351 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 136 transitions. [2025-01-09 02:57:49,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 02:57:49,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:49,352 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:49,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 02:57:49,352 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:57:49,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:49,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1913072055, now seen corresponding path program 1 times [2025-01-09 02:57:49,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:49,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491394420] [2025-01-09 02:57:49,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:49,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:49,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 02:57:49,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 02:57:49,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:49,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:49,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:49,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:49,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491394420] [2025-01-09 02:57:49,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491394420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:49,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:49,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 02:57:49,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086245515] [2025-01-09 02:57:49,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:49,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:57:49,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:49,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:57:49,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:57:49,464 INFO L87 Difference]: Start difference. First operand 90 states and 136 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 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-01-09 02:57:49,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:49,634 INFO L93 Difference]: Finished difference Result 123 states and 187 transitions. [2025-01-09 02:57:49,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 02:57:49,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 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 16 [2025-01-09 02:57:49,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:49,636 INFO L225 Difference]: With dead ends: 123 [2025-01-09 02:57:49,636 INFO L226 Difference]: Without dead ends: 121 [2025-01-09 02:57:49,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 02:57:49,637 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 43 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:49,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 242 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:57:49,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-09 02:57:49,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2025-01-09 02:57:49,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 62 states have internal predecessors, (82), 50 states have call successors, (50), 6 states have call predecessors, (50), 6 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 02:57:49,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 182 transitions. [2025-01-09 02:57:49,663 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 182 transitions. Word has length 16 [2025-01-09 02:57:49,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:49,663 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 182 transitions. [2025-01-09 02:57:49,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 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-01-09 02:57:49,663 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 182 transitions. [2025-01-09 02:57:49,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 02:57:49,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:49,664 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:49,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 02:57:49,664 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:57:49,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:49,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2000532778, now seen corresponding path program 1 times [2025-01-09 02:57:49,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:49,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759503522] [2025-01-09 02:57:49,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:49,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:49,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 02:57:49,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 02:57:49,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:49,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:49,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:49,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759503522] [2025-01-09 02:57:49,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759503522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:49,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:49,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:57:49,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257881808] [2025-01-09 02:57:49,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:49,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:57:49,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:49,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:57:49,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:57:49,719 INFO L87 Difference]: Start difference. First operand 118 states and 182 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 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-01-09 02:57:49,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:49,777 INFO L93 Difference]: Finished difference Result 124 states and 187 transitions. [2025-01-09 02:57:49,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:57:49,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 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 16 [2025-01-09 02:57:49,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:49,779 INFO L225 Difference]: With dead ends: 124 [2025-01-09 02:57:49,779 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 02:57:49,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:57:49,780 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 15 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:49,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 143 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:57:49,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 02:57:49,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-01-09 02:57:49,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.328125) internal successors, (85), 65 states have internal predecessors, (85), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 02:57:49,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 185 transitions. [2025-01-09 02:57:49,799 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 185 transitions. Word has length 16 [2025-01-09 02:57:49,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:49,799 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 185 transitions. [2025-01-09 02:57:49,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 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-01-09 02:57:49,799 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 185 transitions. [2025-01-09 02:57:49,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 02:57:49,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:49,800 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:49,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 02:57:49,800 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:57:49,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:49,801 INFO L85 PathProgramCache]: Analyzing trace with hash -875546465, now seen corresponding path program 1 times [2025-01-09 02:57:49,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:49,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541829967] [2025-01-09 02:57:49,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:49,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:49,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 02:57:49,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 02:57:49,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:49,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:49,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:49,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541829967] [2025-01-09 02:57:49,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541829967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:49,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:49,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 02:57:49,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534177815] [2025-01-09 02:57:49,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:49,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 02:57:49,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:49,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 02:57:49,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:57:49,849 INFO L87 Difference]: Start difference. First operand 122 states and 185 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 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-01-09 02:57:49,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:49,977 INFO L93 Difference]: Finished difference Result 184 states and 287 transitions. [2025-01-09 02:57:49,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:57:49,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 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 16 [2025-01-09 02:57:49,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:49,979 INFO L225 Difference]: With dead ends: 184 [2025-01-09 02:57:49,979 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 02:57:49,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 02:57:49,980 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 31 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:49,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 190 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:57:49,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 02:57:50,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 158. [2025-01-09 02:57:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 80 states have internal predecessors, (100), 74 states have call successors, (74), 8 states have call predecessors, (74), 8 states have return successors, (74), 69 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 02:57:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 248 transitions. [2025-01-09 02:57:50,027 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 248 transitions. Word has length 16 [2025-01-09 02:57:50,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:50,027 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 248 transitions. [2025-01-09 02:57:50,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 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-01-09 02:57:50,027 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 248 transitions. [2025-01-09 02:57:50,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 02:57:50,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:50,028 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:50,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 02:57:50,028 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:57:50,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:50,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1326266041, now seen corresponding path program 1 times [2025-01-09 02:57:50,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:50,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82288207] [2025-01-09 02:57:50,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:50,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:50,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 02:57:50,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 02:57:50,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:50,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:50,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:50,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:50,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82288207] [2025-01-09 02:57:50,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82288207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:50,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:50,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:57:50,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848292782] [2025-01-09 02:57:50,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:50,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:57:50,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:50,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:57:50,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:57:50,055 INFO L87 Difference]: Start difference. First operand 158 states and 248 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 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-01-09 02:57:50,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:50,099 INFO L93 Difference]: Finished difference Result 325 states and 520 transitions. [2025-01-09 02:57:50,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:57:50,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 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 16 [2025-01-09 02:57:50,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:50,101 INFO L225 Difference]: With dead ends: 325 [2025-01-09 02:57:50,101 INFO L226 Difference]: Without dead ends: 235 [2025-01-09 02:57:50,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:57:50,102 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 11 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:50,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 130 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:57:50,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-01-09 02:57:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 205. [2025-01-09 02:57:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 100 states have internal predecessors, (128), 102 states have call successors, (102), 8 states have call predecessors, (102), 8 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 02:57:50,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 332 transitions. [2025-01-09 02:57:50,145 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 332 transitions. Word has length 16 [2025-01-09 02:57:50,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:50,146 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 332 transitions. [2025-01-09 02:57:50,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 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-01-09 02:57:50,146 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 332 transitions. [2025-01-09 02:57:50,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 02:57:50,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:50,146 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:50,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 02:57:50,147 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:57:50,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:50,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2082668974, now seen corresponding path program 1 times [2025-01-09 02:57:50,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:50,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694713349] [2025-01-09 02:57:50,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:50,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:50,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 02:57:50,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 02:57:50,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:50,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 02:57:50,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:50,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694713349] [2025-01-09 02:57:50,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694713349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:50,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:50,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 02:57:50,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812120944] [2025-01-09 02:57:50,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:50,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 02:57:50,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:50,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 02:57:50,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:57:50,219 INFO L87 Difference]: Start difference. First operand 205 states and 332 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 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-01-09 02:57:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:50,356 INFO L93 Difference]: Finished difference Result 271 states and 444 transitions. [2025-01-09 02:57:50,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 02:57:50,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 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 23 [2025-01-09 02:57:50,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:50,359 INFO L225 Difference]: With dead ends: 271 [2025-01-09 02:57:50,359 INFO L226 Difference]: Without dead ends: 269 [2025-01-09 02:57:50,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 02:57:50,360 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 42 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:50,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 231 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:57:50,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-01-09 02:57:50,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 245. [2025-01-09 02:57:50,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 123 states have internal predecessors, (157), 122 states have call successors, (122), 9 states have call predecessors, (122), 9 states have return successors, (122), 112 states have call predecessors, (122), 122 states have call successors, (122) [2025-01-09 02:57:50,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 401 transitions. [2025-01-09 02:57:50,391 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 401 transitions. Word has length 23 [2025-01-09 02:57:50,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:50,392 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 401 transitions. [2025-01-09 02:57:50,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 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-01-09 02:57:50,392 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 401 transitions. [2025-01-09 02:57:50,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 02:57:50,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:50,393 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:50,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 02:57:50,393 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:57:50,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash 709066145, now seen corresponding path program 1 times [2025-01-09 02:57:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:50,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013102579] [2025-01-09 02:57:50,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:50,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:50,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 02:57:50,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 02:57:50,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:50,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 02:57:50,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:50,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013102579] [2025-01-09 02:57:50,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013102579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:50,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:50,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:57:50,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521080568] [2025-01-09 02:57:50,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:50,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:57:50,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:50,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:57:50,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:57:50,439 INFO L87 Difference]: Start difference. First operand 245 states and 401 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 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-01-09 02:57:50,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:50,661 INFO L93 Difference]: Finished difference Result 589 states and 967 transitions. [2025-01-09 02:57:50,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 02:57:50,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 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 25 [2025-01-09 02:57:50,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:50,664 INFO L225 Difference]: With dead ends: 589 [2025-01-09 02:57:50,665 INFO L226 Difference]: Without dead ends: 392 [2025-01-09 02:57:50,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:57:50,666 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 76 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:50,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 121 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:57:50,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-01-09 02:57:50,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 246. [2025-01-09 02:57:50,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 114 states have (on average 1.3771929824561404) internal successors, (157), 124 states have internal predecessors, (157), 122 states have call successors, (122), 9 states have call predecessors, (122), 9 states have return successors, (122), 112 states have call predecessors, (122), 122 states have call successors, (122) [2025-01-09 02:57:50,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 401 transitions. [2025-01-09 02:57:50,718 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 401 transitions. Word has length 25 [2025-01-09 02:57:50,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:50,718 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 401 transitions. [2025-01-09 02:57:50,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 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-01-09 02:57:50,718 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 401 transitions. [2025-01-09 02:57:50,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 02:57:50,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:50,719 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:50,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 02:57:50,719 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:57:50,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:50,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1721472708, now seen corresponding path program 1 times [2025-01-09 02:57:50,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:50,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343310769] [2025-01-09 02:57:50,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:50,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:50,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:57:50,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:57:50,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:50,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:50,807 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 02:57:50,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:50,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343310769] [2025-01-09 02:57:50,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343310769] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:50,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:50,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 02:57:50,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579419458] [2025-01-09 02:57:50,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:50,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 02:57:50,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:50,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 02:57:50,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:57:50,808 INFO L87 Difference]: Start difference. First operand 246 states and 401 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:57:50,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:50,990 INFO L93 Difference]: Finished difference Result 320 states and 517 transitions. [2025-01-09 02:57:50,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:57:50,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2025-01-09 02:57:50,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:50,993 INFO L225 Difference]: With dead ends: 320 [2025-01-09 02:57:50,993 INFO L226 Difference]: Without dead ends: 318 [2025-01-09 02:57:50,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 02:57:50,994 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 25 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:50,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 241 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:57:50,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-01-09 02:57:51,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 296. [2025-01-09 02:57:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 132 states have (on average 1.371212121212121) internal successors, (181), 148 states have internal predecessors, (181), 152 states have call successors, (152), 11 states have call predecessors, (152), 11 states have return successors, (152), 136 states have call predecessors, (152), 152 states have call successors, (152) [2025-01-09 02:57:51,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 485 transitions. [2025-01-09 02:57:51,058 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 485 transitions. Word has length 26 [2025-01-09 02:57:51,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:51,059 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 485 transitions. [2025-01-09 02:57:51,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:57:51,059 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 485 transitions. [2025-01-09 02:57:51,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 02:57:51,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:51,060 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:51,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 02:57:51,060 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:57:51,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:51,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1779454278, now seen corresponding path program 1 times [2025-01-09 02:57:51,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:51,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980984926] [2025-01-09 02:57:51,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:51,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:51,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 02:57:51,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 02:57:51,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:51,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 02:57:51,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:51,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980984926] [2025-01-09 02:57:51,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980984926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:51,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:51,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 02:57:51,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252714482] [2025-01-09 02:57:51,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:51,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:57:51,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:51,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:57:51,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:57:51,165 INFO L87 Difference]: Start difference. First operand 296 states and 485 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:57:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:51,397 INFO L93 Difference]: Finished difference Result 466 states and 784 transitions. [2025-01-09 02:57:51,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 02:57:51,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2025-01-09 02:57:51,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:51,400 INFO L225 Difference]: With dead ends: 466 [2025-01-09 02:57:51,400 INFO L226 Difference]: Without dead ends: 464 [2025-01-09 02:57:51,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 02:57:51,401 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 69 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:51,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 260 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:57:51,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-01-09 02:57:51,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 418. [2025-01-09 02:57:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 178 states have (on average 1.404494382022472) internal successors, (250), 205 states have internal predecessors, (250), 227 states have call successors, (227), 12 states have call predecessors, (227), 12 states have return successors, (227), 200 states have call predecessors, (227), 227 states have call successors, (227) [2025-01-09 02:57:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 704 transitions. [2025-01-09 02:57:51,453 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 704 transitions. Word has length 28 [2025-01-09 02:57:51,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:51,453 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 704 transitions. [2025-01-09 02:57:51,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:57:51,453 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 704 transitions. [2025-01-09 02:57:51,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 02:57:51,454 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:51,454 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:51,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 02:57:51,454 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:57:51,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:51,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1638905668, now seen corresponding path program 1 times [2025-01-09 02:57:51,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:51,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981105200] [2025-01-09 02:57:51,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:51,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:51,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 02:57:51,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 02:57:51,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:51,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:51,525 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 02:57:51,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:51,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981105200] [2025-01-09 02:57:51,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981105200] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:51,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:51,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 02:57:51,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633501707] [2025-01-09 02:57:51,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:51,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:57:51,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:51,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:57:51,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:57:51,526 INFO L87 Difference]: Start difference. First operand 418 states and 704 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:57:51,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:51,717 INFO L93 Difference]: Finished difference Result 485 states and 813 transitions. [2025-01-09 02:57:51,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:57:51,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2025-01-09 02:57:51,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:51,721 INFO L225 Difference]: With dead ends: 485 [2025-01-09 02:57:51,721 INFO L226 Difference]: Without dead ends: 483 [2025-01-09 02:57:51,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 02:57:51,722 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 75 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:51,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 196 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:57:51,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-01-09 02:57:51,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 425. [2025-01-09 02:57:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 181 states have (on average 1.3977900552486189) internal successors, (253), 208 states have internal predecessors, (253), 230 states have call successors, (230), 13 states have call predecessors, (230), 13 states have return successors, (230), 203 states have call predecessors, (230), 230 states have call successors, (230) [2025-01-09 02:57:51,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 713 transitions. [2025-01-09 02:57:51,777 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 713 transitions. Word has length 28 [2025-01-09 02:57:51,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:51,777 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 713 transitions. [2025-01-09 02:57:51,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:57:51,777 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 713 transitions. [2025-01-09 02:57:51,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 02:57:51,778 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:51,778 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:51,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 02:57:51,778 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:57:51,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:51,779 INFO L85 PathProgramCache]: Analyzing trace with hash 650046369, now seen corresponding path program 1 times [2025-01-09 02:57:51,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:51,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23681757] [2025-01-09 02:57:51,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:51,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:51,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 02:57:51,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 02:57:51,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:51,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 02:57:51,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:51,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23681757] [2025-01-09 02:57:51,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23681757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:51,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:51,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 02:57:51,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363991818] [2025-01-09 02:57:51,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:51,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:57:51,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:51,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:57:51,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:57:51,856 INFO L87 Difference]: Start difference. First operand 425 states and 713 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 02:57:52,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:52,050 INFO L93 Difference]: Finished difference Result 480 states and 787 transitions. [2025-01-09 02:57:52,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 02:57:52,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2025-01-09 02:57:52,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:52,053 INFO L225 Difference]: With dead ends: 480 [2025-01-09 02:57:52,053 INFO L226 Difference]: Without dead ends: 478 [2025-01-09 02:57:52,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 02:57:52,054 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 35 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:52,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 249 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:57:52,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-01-09 02:57:52,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 429. [2025-01-09 02:57:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 184 states have (on average 1.391304347826087) internal successors, (256), 211 states have internal predecessors, (256), 230 states have call successors, (230), 14 states have call predecessors, (230), 14 states have return successors, (230), 203 states have call predecessors, (230), 230 states have call successors, (230) [2025-01-09 02:57:52,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 716 transitions. [2025-01-09 02:57:52,123 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 716 transitions. Word has length 38 [2025-01-09 02:57:52,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:52,123 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 716 transitions. [2025-01-09 02:57:52,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 02:57:52,123 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 716 transitions. [2025-01-09 02:57:52,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 02:57:52,124 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:52,124 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:52,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 02:57:52,124 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:57:52,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:52,124 INFO L85 PathProgramCache]: Analyzing trace with hash 758253642, now seen corresponding path program 1 times [2025-01-09 02:57:52,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:52,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882892046] [2025-01-09 02:57:52,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:52,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:52,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 02:57:52,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 02:57:52,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:52,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 02:57:52,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:52,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882892046] [2025-01-09 02:57:52,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882892046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:52,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:52,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 02:57:52,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398519101] [2025-01-09 02:57:52,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:52,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:57:52,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:52,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:57:52,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:57:52,182 INFO L87 Difference]: Start difference. First operand 429 states and 716 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 02:57:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:52,350 INFO L93 Difference]: Finished difference Result 456 states and 752 transitions. [2025-01-09 02:57:52,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 02:57:52,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2025-01-09 02:57:52,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:52,354 INFO L225 Difference]: With dead ends: 456 [2025-01-09 02:57:52,354 INFO L226 Difference]: Without dead ends: 454 [2025-01-09 02:57:52,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 02:57:52,356 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 28 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:52,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 176 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:57:52,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-01-09 02:57:52,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 433. [2025-01-09 02:57:52,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 187 states have (on average 1.3850267379679144) internal successors, (259), 214 states have internal predecessors, (259), 230 states have call successors, (230), 15 states have call predecessors, (230), 15 states have return successors, (230), 203 states have call predecessors, (230), 230 states have call successors, (230) [2025-01-09 02:57:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 719 transitions. [2025-01-09 02:57:52,451 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 719 transitions. Word has length 38 [2025-01-09 02:57:52,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:52,451 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 719 transitions. [2025-01-09 02:57:52,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 02:57:52,452 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 719 transitions. [2025-01-09 02:57:52,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 02:57:52,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:52,453 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:52,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 02:57:52,453 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:57:52,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:52,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1341544532, now seen corresponding path program 1 times [2025-01-09 02:57:52,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:52,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167233115] [2025-01-09 02:57:52,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:52,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:52,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 02:57:52,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 02:57:52,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:52,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 02:57:52,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:52,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167233115] [2025-01-09 02:57:52,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167233115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:52,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:52,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 02:57:52,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332880731] [2025-01-09 02:57:52,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:52,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:57:52,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:52,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:57:52,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:57:52,533 INFO L87 Difference]: Start difference. First operand 433 states and 719 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 02:57:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:52,693 INFO L93 Difference]: Finished difference Result 497 states and 822 transitions. [2025-01-09 02:57:52,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 02:57:52,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2025-01-09 02:57:52,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:52,697 INFO L225 Difference]: With dead ends: 497 [2025-01-09 02:57:52,697 INFO L226 Difference]: Without dead ends: 495 [2025-01-09 02:57:52,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 02:57:52,698 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 41 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:52,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 222 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:57:52,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-01-09 02:57:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 437. [2025-01-09 02:57:52,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 190 states have (on average 1.3789473684210527) internal successors, (262), 217 states have internal predecessors, (262), 230 states have call successors, (230), 16 states have call predecessors, (230), 16 states have return successors, (230), 203 states have call predecessors, (230), 230 states have call successors, (230) [2025-01-09 02:57:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 722 transitions. [2025-01-09 02:57:52,756 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 722 transitions. Word has length 50 [2025-01-09 02:57:52,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:52,756 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 722 transitions. [2025-01-09 02:57:52,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 02:57:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 722 transitions. [2025-01-09 02:57:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 02:57:52,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:52,757 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:52,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 02:57:52,758 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:57:52,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:52,758 INFO L85 PathProgramCache]: Analyzing trace with hash -890131189, now seen corresponding path program 1 times [2025-01-09 02:57:52,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:52,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830138452] [2025-01-09 02:57:52,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:52,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:52,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 02:57:52,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 02:57:52,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:52,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 02:57:52,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:52,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830138452] [2025-01-09 02:57:52,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830138452] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:57:52,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251801203] [2025-01-09 02:57:52,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:52,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:57:52,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:57:52,841 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-01-09 02:57:52,843 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-01-09 02:57:52,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 02:57:52,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 02:57:52,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:52,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:52,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 02:57:52,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:57:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-09 02:57:52,971 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:57:52,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251801203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:52,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 02:57:52,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2025-01-09 02:57:52,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228099444] [2025-01-09 02:57:52,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:52,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 02:57:52,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:52,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 02:57:52,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 02:57:52,975 INFO L87 Difference]: Start difference. First operand 437 states and 722 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 02:57:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:53,165 INFO L93 Difference]: Finished difference Result 879 states and 1444 transitions. [2025-01-09 02:57:53,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 02:57:53,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2025-01-09 02:57:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:53,169 INFO L225 Difference]: With dead ends: 879 [2025-01-09 02:57:53,169 INFO L226 Difference]: Without dead ends: 473 [2025-01-09 02:57:53,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 02:57:53,172 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 39 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:53,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 144 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:57:53,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-01-09 02:57:53,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 443. [2025-01-09 02:57:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 196 states have (on average 1.3673469387755102) internal successors, (268), 220 states have internal predecessors, (268), 230 states have call successors, (230), 16 states have call predecessors, (230), 16 states have return successors, (230), 206 states have call predecessors, (230), 230 states have call successors, (230) [2025-01-09 02:57:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 728 transitions. [2025-01-09 02:57:53,248 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 728 transitions. Word has length 58 [2025-01-09 02:57:53,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:53,249 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 728 transitions. [2025-01-09 02:57:53,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 02:57:53,249 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 728 transitions. [2025-01-09 02:57:53,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 02:57:53,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:53,252 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:53,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 02:57:53,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 02:57:53,456 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:57:53,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:53,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2096844213, now seen corresponding path program 1 times [2025-01-09 02:57:53,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:53,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819214238] [2025-01-09 02:57:53,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:53,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:53,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 02:57:53,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 02:57:53,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:53,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:53,539 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 02:57:53,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:53,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819214238] [2025-01-09 02:57:53,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819214238] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:57:53,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911202251] [2025-01-09 02:57:53,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:53,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:57:53,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:57:53,541 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-01-09 02:57:53,543 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-01-09 02:57:53,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 02:57:53,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 02:57:53,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:53,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:53,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 02:57:53,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:57:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-01-09 02:57:53,778 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:57:53,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911202251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:53,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 02:57:53,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-01-09 02:57:53,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619322130] [2025-01-09 02:57:53,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:53,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 02:57:53,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:53,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 02:57:53,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 02:57:53,779 INFO L87 Difference]: Start difference. First operand 443 states and 728 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 02:57:54,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:54,011 INFO L93 Difference]: Finished difference Result 798 states and 1292 transitions. [2025-01-09 02:57:54,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 02:57:54,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2025-01-09 02:57:54,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:54,014 INFO L225 Difference]: With dead ends: 798 [2025-01-09 02:57:54,014 INFO L226 Difference]: Without dead ends: 290 [2025-01-09 02:57:54,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-09 02:57:54,016 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 37 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:54,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 219 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:57:54,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-01-09 02:57:54,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 280. [2025-01-09 02:57:54,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 144 states have internal predecessors, (170), 134 states have call successors, (134), 15 states have call predecessors, (134), 15 states have return successors, (134), 120 states have call predecessors, (134), 134 states have call successors, (134) [2025-01-09 02:57:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 438 transitions. [2025-01-09 02:57:54,060 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 438 transitions. Word has length 80 [2025-01-09 02:57:54,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:54,060 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 438 transitions. [2025-01-09 02:57:54,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 02:57:54,060 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 438 transitions. [2025-01-09 02:57:54,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 02:57:54,062 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:54,062 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:54,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 02:57:54,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 02:57:54,263 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:57:54,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:54,263 INFO L85 PathProgramCache]: Analyzing trace with hash 741156005, now seen corresponding path program 1 times [2025-01-09 02:57:54,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:54,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432083455] [2025-01-09 02:57:54,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:54,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:54,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 02:57:54,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 02:57:54,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:54,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:54,342 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 37 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 02:57:54,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:54,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432083455] [2025-01-09 02:57:54,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432083455] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:57:54,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040951786] [2025-01-09 02:57:54,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:54,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:57:54,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:57:54,344 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-01-09 02:57:54,345 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-01-09 02:57:54,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 02:57:54,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 02:57:54,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:54,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:54,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 02:57:54,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:57:54,450 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-01-09 02:57:54,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:57:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-01-09 02:57:54,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040951786] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:57:54,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:57:54,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2025-01-09 02:57:54,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861210588] [2025-01-09 02:57:54,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:57:54,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 02:57:54,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:54,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 02:57:54,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-01-09 02:57:54,559 INFO L87 Difference]: Start difference. First operand 280 states and 438 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 7 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2025-01-09 02:57:55,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:55,637 INFO L93 Difference]: Finished difference Result 657 states and 1017 transitions. [2025-01-09 02:57:55,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-09 02:57:55,637 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 7 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) Word has length 85 [2025-01-09 02:57:55,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:55,640 INFO L225 Difference]: With dead ends: 657 [2025-01-09 02:57:55,640 INFO L226 Difference]: Without dead ends: 425 [2025-01-09 02:57:55,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=549, Invalid=1613, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 02:57:55,642 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 217 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:55,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 936 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 02:57:55,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-01-09 02:57:55,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 313. [2025-01-09 02:57:55,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 166 states have internal predecessors, (195), 143 states have call successors, (143), 17 states have call predecessors, (143), 17 states have return successors, (143), 129 states have call predecessors, (143), 143 states have call successors, (143) [2025-01-09 02:57:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 481 transitions. [2025-01-09 02:57:55,686 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 481 transitions. Word has length 85 [2025-01-09 02:57:55,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:55,686 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 481 transitions. [2025-01-09 02:57:55,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 7 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2025-01-09 02:57:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 481 transitions. [2025-01-09 02:57:55,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 02:57:55,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:55,687 INFO L218 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:55,693 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-01-09 02:57:55,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:57:55,888 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:57:55,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:55,888 INFO L85 PathProgramCache]: Analyzing trace with hash -829067165, now seen corresponding path program 1 times [2025-01-09 02:57:55,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:55,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502607405] [2025-01-09 02:57:55,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:55,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:55,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 02:57:55,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 02:57:55,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:55,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:56,027 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 02:57:56,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:56,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502607405] [2025-01-09 02:57:56,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502607405] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:57:56,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947084100] [2025-01-09 02:57:56,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:56,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:57:56,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:57:56,031 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-01-09 02:57:56,039 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-01-09 02:57:56,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 02:57:56,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 02:57:56,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:56,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:56,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 02:57:56,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:57:56,277 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 02:57:56,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:57:56,471 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 02:57:56,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947084100] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:57:56,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:57:56,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2025-01-09 02:57:56,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623383842] [2025-01-09 02:57:56,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:57:56,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 02:57:56,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:56,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 02:57:56,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-01-09 02:57:56,473 INFO L87 Difference]: Start difference. First operand 313 states and 481 transitions. Second operand has 20 states, 20 states have (on average 3.3) internal successors, (66), 18 states have internal predecessors, (66), 8 states have call successors, (50), 3 states have call predecessors, (50), 1 states have return successors, (47), 8 states have call predecessors, (47), 8 states have call successors, (47) [2025-01-09 02:57:57,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:57,473 INFO L93 Difference]: Finished difference Result 754 states and 1197 transitions. [2025-01-09 02:57:57,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 02:57:57,474 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 18 states have internal predecessors, (66), 8 states have call successors, (50), 3 states have call predecessors, (50), 1 states have return successors, (47), 8 states have call predecessors, (47), 8 states have call successors, (47) Word has length 112 [2025-01-09 02:57:57,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:57,478 INFO L225 Difference]: With dead ends: 754 [2025-01-09 02:57:57,478 INFO L226 Difference]: Without dead ends: 752 [2025-01-09 02:57:57,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 211 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=363, Invalid=1119, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 02:57:57,479 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 216 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:57,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 688 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 02:57:57,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2025-01-09 02:57:57,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 425. [2025-01-09 02:57:57,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 201 states have (on average 1.3233830845771144) internal successors, (266), 221 states have internal predecessors, (266), 203 states have call successors, (203), 20 states have call predecessors, (203), 20 states have return successors, (203), 183 states have call predecessors, (203), 203 states have call successors, (203) [2025-01-09 02:57:57,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 672 transitions. [2025-01-09 02:57:57,556 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 672 transitions. Word has length 112 [2025-01-09 02:57:57,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:57,557 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 672 transitions. [2025-01-09 02:57:57,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 18 states have internal predecessors, (66), 8 states have call successors, (50), 3 states have call predecessors, (50), 1 states have return successors, (47), 8 states have call predecessors, (47), 8 states have call successors, (47) [2025-01-09 02:57:57,558 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 672 transitions. [2025-01-09 02:57:57,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 02:57:57,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:57,561 INFO L218 NwaCegarLoop]: trace histogram [28, 27, 27, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:57,567 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-01-09 02:57:57,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:57:57,761 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:57:57,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:57,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1061841074, now seen corresponding path program 1 times [2025-01-09 02:57:57,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:57,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849751495] [2025-01-09 02:57:57,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:57,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:57,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 02:57:57,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 02:57:57,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:57,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:57,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 74 proven. 32 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 02:57:57,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:57,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849751495] [2025-01-09 02:57:57,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849751495] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:57:57,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811579344] [2025-01-09 02:57:57,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:57,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:57:57,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:57:57,910 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-01-09 02:57:57,915 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-01-09 02:57:57,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 02:57:57,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 02:57:57,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:57,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:57,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 02:57:57,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:57:58,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 794 proven. 8 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2025-01-09 02:57:58,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:57:58,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 90 proven. 10 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2025-01-09 02:57:58,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811579344] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:57:58,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:57:58,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2025-01-09 02:57:58,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198128555] [2025-01-09 02:57:58,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:57:58,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 02:57:58,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:58,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 02:57:58,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-01-09 02:57:58,338 INFO L87 Difference]: Start difference. First operand 425 states and 672 transitions. Second operand has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 11 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 11 states have call predecessors, (70), 11 states have call successors, (70) [2025-01-09 02:58:00,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:00,226 INFO L93 Difference]: Finished difference Result 1259 states and 2022 transitions. [2025-01-09 02:58:00,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-01-09 02:58:00,227 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 11 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 11 states have call predecessors, (70), 11 states have call successors, (70) Word has length 169 [2025-01-09 02:58:00,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:00,231 INFO L225 Difference]: With dead ends: 1259 [2025-01-09 02:58:00,231 INFO L226 Difference]: Without dead ends: 637 [2025-01-09 02:58:00,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=907, Invalid=3515, Unknown=0, NotChecked=0, Total=4422 [2025-01-09 02:58:00,234 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 273 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 1803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:00,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 909 Invalid, 1803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 02:58:00,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-01-09 02:58:00,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 540. [2025-01-09 02:58:00,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 242 states have (on average 1.2975206611570247) internal successors, (314), 267 states have internal predecessors, (314), 278 states have call successors, (278), 19 states have call predecessors, (278), 19 states have return successors, (278), 253 states have call predecessors, (278), 278 states have call successors, (278) [2025-01-09 02:58:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 870 transitions. [2025-01-09 02:58:00,329 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 870 transitions. Word has length 169 [2025-01-09 02:58:00,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:00,330 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 870 transitions. [2025-01-09 02:58:00,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 11 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 11 states have call predecessors, (70), 11 states have call successors, (70) [2025-01-09 02:58:00,330 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 870 transitions. [2025-01-09 02:58:00,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-09 02:58:00,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:00,333 INFO L218 NwaCegarLoop]: trace histogram [32, 31, 31, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:00,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 02:58:00,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:58:00,534 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:00,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:00,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1655913330, now seen corresponding path program 2 times [2025-01-09 02:58:00,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:00,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903211863] [2025-01-09 02:58:00,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:58:00,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:00,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 191 statements into 2 equivalence classes. [2025-01-09 02:58:00,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 02:58:00,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:58:00,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:00,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1986 backedges. 63 proven. 63 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 02:58:00,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:00,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903211863] [2025-01-09 02:58:00,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903211863] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:58:00,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207809981] [2025-01-09 02:58:00,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:58:00,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:58:00,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:58:00,810 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:58:00,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 02:58:00,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 191 statements into 2 equivalence classes. [2025-01-09 02:58:00,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 02:58:00,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:58:00,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:00,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 02:58:00,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:58:01,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1986 backedges. 107 proven. 19 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 02:58:01,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:58:01,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1986 backedges. 62 proven. 64 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 02:58:01,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207809981] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:58:01,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:58:01,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2025-01-09 02:58:01,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509848547] [2025-01-09 02:58:01,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:58:01,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 02:58:01,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:01,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 02:58:01,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2025-01-09 02:58:01,499 INFO L87 Difference]: Start difference. First operand 540 states and 870 transitions. Second operand has 30 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 28 states have internal predecessors, (100), 17 states have call successors, (96), 3 states have call predecessors, (96), 1 states have return successors, (93), 17 states have call predecessors, (93), 17 states have call successors, (93) [2025-01-09 02:58:03,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:03,021 INFO L93 Difference]: Finished difference Result 911 states and 1492 transitions. [2025-01-09 02:58:03,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-09 02:58:03,024 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 28 states have internal predecessors, (100), 17 states have call successors, (96), 3 states have call predecessors, (96), 1 states have return successors, (93), 17 states have call predecessors, (93), 17 states have call successors, (93) Word has length 191 [2025-01-09 02:58:03,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:03,026 INFO L225 Difference]: With dead ends: 911 [2025-01-09 02:58:03,026 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 02:58:03,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1046, Invalid=2986, Unknown=0, NotChecked=0, Total=4032 [2025-01-09 02:58:03,030 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 185 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:03,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1915 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 02:58:03,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 02:58:03,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 02:58:03,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 02:58:03,032 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 191 [2025-01-09 02:58:03,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:03,032 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 02:58:03,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 28 states have internal predecessors, (100), 17 states have call successors, (96), 3 states have call predecessors, (96), 1 states have return successors, (93), 17 states have call predecessors, (93), 17 states have call successors, (93) [2025-01-09 02:58:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 02:58:03,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 02:58:03,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 02:58:03,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 02:58:03,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-09 02:58:03,237 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:03,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.