./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-70.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 7ce47381267ee67677a133028db906aae8ff01d6ab9cce9bbfb67fc1f629a942 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:43:27,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:43:27,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:43:27,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:43:27,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:43:27,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:43:27,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:43:27,665 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:43:27,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:43:27,665 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:43:27,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:43:27,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:43:27,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:43:27,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:43:27,666 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:43:27,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:43:27,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:43:27,666 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:43:27,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:43:27,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:43:27,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:43:27,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:43:27,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:43:27,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:43:27,667 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:43:27,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:43:27,667 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:43:27,667 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:43:27,667 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:43:27,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:43:27,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:43:27,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:43:27,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:43:27,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:43:27,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:43:27,668 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:43:27,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:43:27,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:43:27,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:43:27,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:43:27,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:43:27,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:43:27,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:43:27,668 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 -> 7ce47381267ee67677a133028db906aae8ff01d6ab9cce9bbfb67fc1f629a942 [2025-02-06 02:43:27,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:43:27,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:43:27,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:43:27,927 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:43:27,927 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:43:27,928 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-70.i [2025-02-06 02:43:29,069 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd6a25ee2/1c10a148a9094e37a1ee43bd15e85c65/FLAG2372cdebe [2025-02-06 02:43:29,406 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:43:29,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-70.i [2025-02-06 02:43:29,424 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd6a25ee2/1c10a148a9094e37a1ee43bd15e85c65/FLAG2372cdebe [2025-02-06 02:43:29,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd6a25ee2/1c10a148a9094e37a1ee43bd15e85c65 [2025-02-06 02:43:29,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:43:29,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:43:29,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:43:29,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:43:29,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:43:29,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:43:29" (1/1) ... [2025-02-06 02:43:29,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164ad910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:29, skipping insertion in model container [2025-02-06 02:43:29,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:43:29" (1/1) ... [2025-02-06 02:43:29,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:43:29,785 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/hardness-nfm22/hardness_operatoramount_amount500_file-70.i[916,929] [2025-02-06 02:43:29,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:43:29,992 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:43:30,003 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/hardness-nfm22/hardness_operatoramount_amount500_file-70.i[916,929] [2025-02-06 02:43:30,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:43:30,117 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:43:30,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:30 WrapperNode [2025-02-06 02:43:30,118 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:43:30,119 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:43:30,119 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:43:30,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:43:30,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:30" (1/1) ... [2025-02-06 02:43:30,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:30" (1/1) ... [2025-02-06 02:43:30,225 INFO L138 Inliner]: procedures = 26, calls = 73, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 706 [2025-02-06 02:43:30,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:43:30,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:43:30,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:43:30,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:43:30,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:30" (1/1) ... [2025-02-06 02:43:30,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:30" (1/1) ... [2025-02-06 02:43:30,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:30" (1/1) ... [2025-02-06 02:43:30,340 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:43:30,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:30" (1/1) ... [2025-02-06 02:43:30,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:30" (1/1) ... [2025-02-06 02:43:30,367 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:30" (1/1) ... [2025-02-06 02:43:30,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:30" (1/1) ... [2025-02-06 02:43:30,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:30" (1/1) ... [2025-02-06 02:43:30,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:30" (1/1) ... [2025-02-06 02:43:30,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:43:30,400 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:43:30,400 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:43:30,400 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:43:30,401 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:30" (1/1) ... [2025-02-06 02:43:30,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:43:30,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:43:30,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:43:30,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:43:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:43:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:43:30,453 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:43:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:43:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:43:30,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:43:30,564 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:43:30,566 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:43:31,521 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L635: havoc property_#t~bitwise47#1;havoc property_#t~short48#1;havoc property_#t~bitwise49#1;havoc property_#t~short50#1;havoc property_#t~ite54#1;havoc property_#t~bitwise51#1;havoc property_#t~ite53#1;havoc property_#t~bitwise52#1;havoc property_#t~short55#1;havoc property_#t~ite59#1;havoc property_#t~ite58#1;havoc property_#t~ite57#1;havoc property_#t~bitwise56#1;havoc property_#t~short60#1; [2025-02-06 02:43:31,625 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2025-02-06 02:43:31,626 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:43:31,652 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:43:31,655 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:43:31,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:43:31 BoogieIcfgContainer [2025-02-06 02:43:31,655 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:43:31,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:43:31,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:43:31,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:43:31,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:43:29" (1/3) ... [2025-02-06 02:43:31,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c70260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:43:31, skipping insertion in model container [2025-02-06 02:43:31,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:43:30" (2/3) ... [2025-02-06 02:43:31,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c70260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:43:31, skipping insertion in model container [2025-02-06 02:43:31,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:43:31" (3/3) ... [2025-02-06 02:43:31,663 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-70.i [2025-02-06 02:43:31,674 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:43:31,677 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-70.i that has 2 procedures, 280 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:43:31,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:43:31,743 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;@1fac8be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:43:31,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:43:31,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 280 states, 217 states have (on average 1.5529953917050692) internal successors, (337), 218 states have internal predecessors, (337), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 02:43:31,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-02-06 02:43:31,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:31,769 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:31,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:31,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:31,773 INFO L85 PathProgramCache]: Analyzing trace with hash 4180591, now seen corresponding path program 1 times [2025-02-06 02:43:31,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:31,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647151376] [2025-02-06 02:43:31,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:31,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:31,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-02-06 02:43:31,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-02-06 02:43:31,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:31,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2025-02-06 02:43:32,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:32,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647151376] [2025-02-06 02:43:32,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647151376] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:43:32,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506904303] [2025-02-06 02:43:32,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:32,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:43:32,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:43:32,309 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:43:32,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:43:32,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-02-06 02:43:32,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-02-06 02:43:32,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:32,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:32,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 1090 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:43:32,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:43:32,696 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2025-02-06 02:43:32,696 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:43:32,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506904303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:32,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:43:32,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:43:32,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624805649] [2025-02-06 02:43:32,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:32,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:43:32,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:32,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:43:32,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:43:32,724 INFO L87 Difference]: Start difference. First operand has 280 states, 217 states have (on average 1.5529953917050692) internal successors, (337), 218 states have internal predecessors, (337), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) Second operand has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) [2025-02-06 02:43:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:32,784 INFO L93 Difference]: Finished difference Result 552 states and 965 transitions. [2025-02-06 02:43:32,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:43:32,786 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) Word has length 432 [2025-02-06 02:43:32,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:32,797 INFO L225 Difference]: With dead ends: 552 [2025-02-06 02:43:32,797 INFO L226 Difference]: Without dead ends: 275 [2025-02-06 02:43:32,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:43:32,803 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:32,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 437 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:43:32,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-06 02:43:32,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-02-06 02:43:32,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 213 states have (on average 1.5352112676056338) internal successors, (327), 213 states have internal predecessors, (327), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 02:43:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 447 transitions. [2025-02-06 02:43:32,855 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 447 transitions. Word has length 432 [2025-02-06 02:43:32,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:32,855 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 447 transitions. [2025-02-06 02:43:32,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) [2025-02-06 02:43:32,856 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 447 transitions. [2025-02-06 02:43:32,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-02-06 02:43:32,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:32,864 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:32,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 02:43:33,065 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,SelfDestructingSolverStorable0 [2025-02-06 02:43:33,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:33,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:33,066 INFO L85 PathProgramCache]: Analyzing trace with hash 694440939, now seen corresponding path program 1 times [2025-02-06 02:43:33,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:33,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781358518] [2025-02-06 02:43:33,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:33,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:33,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-02-06 02:43:33,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-02-06 02:43:33,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:33,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:33,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:33,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:33,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781358518] [2025-02-06 02:43:33,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781358518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:33,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:33,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:43:33,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632650997] [2025-02-06 02:43:33,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:33,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:43:33,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:33,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:43:33,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:43:33,536 INFO L87 Difference]: Start difference. First operand 275 states and 447 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:33,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:33,660 INFO L93 Difference]: Finished difference Result 762 states and 1242 transitions. [2025-02-06 02:43:33,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:43:33,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 432 [2025-02-06 02:43:33,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:33,667 INFO L225 Difference]: With dead ends: 762 [2025-02-06 02:43:33,669 INFO L226 Difference]: Without dead ends: 490 [2025-02-06 02:43:33,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:43:33,672 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 344 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:33,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 847 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:43:33,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-02-06 02:43:33,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 487. [2025-02-06 02:43:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 389 states have (on average 1.5526992287917738) internal successors, (604), 390 states have internal predecessors, (604), 95 states have call successors, (95), 2 states have call predecessors, (95), 2 states have return successors, (95), 94 states have call predecessors, (95), 95 states have call successors, (95) [2025-02-06 02:43:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 794 transitions. [2025-02-06 02:43:33,724 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 794 transitions. Word has length 432 [2025-02-06 02:43:33,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:33,727 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 794 transitions. [2025-02-06 02:43:33,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:33,728 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 794 transitions. [2025-02-06 02:43:33,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-02-06 02:43:33,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:33,734 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:33,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:43:33,734 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:33,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:33,735 INFO L85 PathProgramCache]: Analyzing trace with hash -261080340, now seen corresponding path program 1 times [2025-02-06 02:43:33,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:33,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671072697] [2025-02-06 02:43:33,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:33,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:33,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-02-06 02:43:33,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-02-06 02:43:33,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:33,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:34,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:34,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671072697] [2025-02-06 02:43:34,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671072697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:34,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:34,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:43:34,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219440972] [2025-02-06 02:43:34,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:34,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:43:34,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:34,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:43:34,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:43:34,121 INFO L87 Difference]: Start difference. First operand 487 states and 794 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:34,260 INFO L93 Difference]: Finished difference Result 1443 states and 2355 transitions. [2025-02-06 02:43:34,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:43:34,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 432 [2025-02-06 02:43:34,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:34,270 INFO L225 Difference]: With dead ends: 1443 [2025-02-06 02:43:34,270 INFO L226 Difference]: Without dead ends: 959 [2025-02-06 02:43:34,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:43:34,273 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 418 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:34,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1021 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:43:34,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-02-06 02:43:34,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 529. [2025-02-06 02:43:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 431 states have (on average 1.5638051044083527) internal successors, (674), 432 states have internal predecessors, (674), 95 states have call successors, (95), 2 states have call predecessors, (95), 2 states have return successors, (95), 94 states have call predecessors, (95), 95 states have call successors, (95) [2025-02-06 02:43:34,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 864 transitions. [2025-02-06 02:43:34,330 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 864 transitions. Word has length 432 [2025-02-06 02:43:34,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:34,330 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 864 transitions. [2025-02-06 02:43:34,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 864 transitions. [2025-02-06 02:43:34,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-02-06 02:43:34,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:34,335 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:34,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:43:34,335 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:34,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:34,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1879259767, now seen corresponding path program 1 times [2025-02-06 02:43:34,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:34,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306077884] [2025-02-06 02:43:34,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:34,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:34,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-02-06 02:43:34,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-02-06 02:43:34,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:34,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:34,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:34,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306077884] [2025-02-06 02:43:34,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306077884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:34,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:34,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:43:34,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823406795] [2025-02-06 02:43:34,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:34,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:43:34,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:34,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:43:34,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:34,844 INFO L87 Difference]: Start difference. First operand 529 states and 864 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:35,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:35,629 INFO L93 Difference]: Finished difference Result 3087 states and 5036 transitions. [2025-02-06 02:43:35,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:43:35,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 432 [2025-02-06 02:43:35,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:35,647 INFO L225 Difference]: With dead ends: 3087 [2025-02-06 02:43:35,647 INFO L226 Difference]: Without dead ends: 2561 [2025-02-06 02:43:35,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-02-06 02:43:35,650 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 2162 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2162 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:35,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2162 Valid, 2330 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:43:35,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2025-02-06 02:43:35,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 1177. [2025-02-06 02:43:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1059 states have (on average 1.627006610009443) internal successors, (1723), 1062 states have internal predecessors, (1723), 113 states have call successors, (113), 4 states have call predecessors, (113), 4 states have return successors, (113), 110 states have call predecessors, (113), 113 states have call successors, (113) [2025-02-06 02:43:35,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1949 transitions. [2025-02-06 02:43:35,761 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1949 transitions. Word has length 432 [2025-02-06 02:43:35,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:35,761 INFO L471 AbstractCegarLoop]: Abstraction has 1177 states and 1949 transitions. [2025-02-06 02:43:35,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:35,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1949 transitions. [2025-02-06 02:43:35,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-02-06 02:43:35,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:35,767 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:35,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:43:35,767 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:35,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:35,767 INFO L85 PathProgramCache]: Analyzing trace with hash -246455768, now seen corresponding path program 1 times [2025-02-06 02:43:35,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:35,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137066778] [2025-02-06 02:43:35,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:35,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:35,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-02-06 02:43:35,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-02-06 02:43:35,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:35,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:35,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:35,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137066778] [2025-02-06 02:43:35,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137066778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:35,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:35,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:43:35,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18963038] [2025-02-06 02:43:35,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:35,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:43:35,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:35,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:43:35,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:43:35,993 INFO L87 Difference]: Start difference. First operand 1177 states and 1949 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:36,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:36,151 INFO L93 Difference]: Finished difference Result 3485 states and 5761 transitions. [2025-02-06 02:43:36,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:43:36,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 432 [2025-02-06 02:43:36,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:36,161 INFO L225 Difference]: With dead ends: 3485 [2025-02-06 02:43:36,161 INFO L226 Difference]: Without dead ends: 2311 [2025-02-06 02:43:36,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:43:36,164 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 390 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:36,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 825 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:43:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2025-02-06 02:43:36,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 1805. [2025-02-06 02:43:36,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1687 states have (on average 1.6212211025489034) internal successors, (2735), 1690 states have internal predecessors, (2735), 113 states have call successors, (113), 4 states have call predecessors, (113), 4 states have return successors, (113), 110 states have call predecessors, (113), 113 states have call successors, (113) [2025-02-06 02:43:36,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2961 transitions. [2025-02-06 02:43:36,217 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2961 transitions. Word has length 432 [2025-02-06 02:43:36,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:36,218 INFO L471 AbstractCegarLoop]: Abstraction has 1805 states and 2961 transitions. [2025-02-06 02:43:36,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2961 transitions. [2025-02-06 02:43:36,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-02-06 02:43:36,225 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:36,225 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:36,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:43:36,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:36,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:36,227 INFO L85 PathProgramCache]: Analyzing trace with hash 369435381, now seen corresponding path program 1 times [2025-02-06 02:43:36,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:36,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286369832] [2025-02-06 02:43:36,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:36,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:36,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-02-06 02:43:36,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-02-06 02:43:36,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:36,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:36,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:36,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286369832] [2025-02-06 02:43:36,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286369832] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:36,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:36,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:36,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234041995] [2025-02-06 02:43:36,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:36,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:36,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:36,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:36,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:36,797 INFO L87 Difference]: Start difference. First operand 1805 states and 2961 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:37,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:37,194 INFO L93 Difference]: Finished difference Result 5318 states and 8735 transitions. [2025-02-06 02:43:37,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:43:37,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 433 [2025-02-06 02:43:37,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:37,208 INFO L225 Difference]: With dead ends: 5318 [2025-02-06 02:43:37,209 INFO L226 Difference]: Without dead ends: 3516 [2025-02-06 02:43:37,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:37,214 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 335 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:37,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1262 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:43:37,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3516 states. [2025-02-06 02:43:37,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3516 to 3354. [2025-02-06 02:43:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3354 states, 3174 states have (on average 1.634845620667927) internal successors, (5189), 3177 states have internal predecessors, (5189), 173 states have call successors, (173), 6 states have call predecessors, (173), 6 states have return successors, (173), 170 states have call predecessors, (173), 173 states have call successors, (173) [2025-02-06 02:43:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 5535 transitions. [2025-02-06 02:43:37,339 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 5535 transitions. Word has length 433 [2025-02-06 02:43:37,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:37,341 INFO L471 AbstractCegarLoop]: Abstraction has 3354 states and 5535 transitions. [2025-02-06 02:43:37,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:37,342 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 5535 transitions. [2025-02-06 02:43:37,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-02-06 02:43:37,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:37,350 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:37,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:43:37,350 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:37,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:37,351 INFO L85 PathProgramCache]: Analyzing trace with hash 980855169, now seen corresponding path program 1 times [2025-02-06 02:43:37,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:37,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171058114] [2025-02-06 02:43:37,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:37,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:37,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-02-06 02:43:37,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-02-06 02:43:37,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:37,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:37,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:37,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171058114] [2025-02-06 02:43:37,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171058114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:37,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:37,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:37,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502671856] [2025-02-06 02:43:37,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:37,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:37,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:37,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:37,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:37,839 INFO L87 Difference]: Start difference. First operand 3354 states and 5535 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:38,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:38,211 INFO L93 Difference]: Finished difference Result 6751 states and 11126 transitions. [2025-02-06 02:43:38,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:43:38,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 434 [2025-02-06 02:43:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:38,224 INFO L225 Difference]: With dead ends: 6751 [2025-02-06 02:43:38,224 INFO L226 Difference]: Without dead ends: 3516 [2025-02-06 02:43:38,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:38,229 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 331 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:38,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1265 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:43:38,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3516 states. [2025-02-06 02:43:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3516 to 3358. [2025-02-06 02:43:38,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3358 states, 3178 states have (on average 1.63373190685966) internal successors, (5192), 3181 states have internal predecessors, (5192), 173 states have call successors, (173), 6 states have call predecessors, (173), 6 states have return successors, (173), 170 states have call predecessors, (173), 173 states have call successors, (173) [2025-02-06 02:43:38,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 3358 states and 5538 transitions. [2025-02-06 02:43:38,319 INFO L78 Accepts]: Start accepts. Automaton has 3358 states and 5538 transitions. Word has length 434 [2025-02-06 02:43:38,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:38,319 INFO L471 AbstractCegarLoop]: Abstraction has 3358 states and 5538 transitions. [2025-02-06 02:43:38,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:38,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3358 states and 5538 transitions. [2025-02-06 02:43:38,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-02-06 02:43:38,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:38,326 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:38,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:43:38,326 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:38,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:38,327 INFO L85 PathProgramCache]: Analyzing trace with hash -584586315, now seen corresponding path program 1 times [2025-02-06 02:43:38,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:38,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357708818] [2025-02-06 02:43:38,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:38,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:38,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-02-06 02:43:38,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-02-06 02:43:38,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:38,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:39,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:39,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:39,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357708818] [2025-02-06 02:43:39,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357708818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:39,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:39,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:43:39,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576049120] [2025-02-06 02:43:39,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:39,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:43:39,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:39,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:43:39,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:39,020 INFO L87 Difference]: Start difference. First operand 3358 states and 5538 transitions. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:39,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:39,597 INFO L93 Difference]: Finished difference Result 6362 states and 10399 transitions. [2025-02-06 02:43:39,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:43:39,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-02-06 02:43:39,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:39,616 INFO L225 Difference]: With dead ends: 6362 [2025-02-06 02:43:39,616 INFO L226 Difference]: Without dead ends: 4328 [2025-02-06 02:43:39,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:39,622 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 794 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:39,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1796 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:43:39,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4328 states. [2025-02-06 02:43:39,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4328 to 3614. [2025-02-06 02:43:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3614 states, 3434 states have (on average 1.6284216656959813) internal successors, (5592), 3437 states have internal predecessors, (5592), 173 states have call successors, (173), 6 states have call predecessors, (173), 6 states have return successors, (173), 170 states have call predecessors, (173), 173 states have call successors, (173) [2025-02-06 02:43:39,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 5938 transitions. [2025-02-06 02:43:39,721 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 5938 transitions. Word has length 435 [2025-02-06 02:43:39,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:39,722 INFO L471 AbstractCegarLoop]: Abstraction has 3614 states and 5938 transitions. [2025-02-06 02:43:39,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 5938 transitions. [2025-02-06 02:43:39,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-02-06 02:43:39,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:39,728 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:39,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:43:39,728 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:39,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:39,729 INFO L85 PathProgramCache]: Analyzing trace with hash 950950677, now seen corresponding path program 1 times [2025-02-06 02:43:39,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:39,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504739859] [2025-02-06 02:43:39,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:39,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:39,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-02-06 02:43:39,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-02-06 02:43:39,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:39,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:40,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:40,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504739859] [2025-02-06 02:43:40,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504739859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:40,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:40,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:43:40,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605426516] [2025-02-06 02:43:40,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:40,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:43:40,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:40,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:43:40,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:43:40,411 INFO L87 Difference]: Start difference. First operand 3614 states and 5938 transitions. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:41,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:41,401 INFO L93 Difference]: Finished difference Result 9212 states and 15016 transitions. [2025-02-06 02:43:41,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:43:41,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-02-06 02:43:41,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:41,426 INFO L225 Difference]: With dead ends: 9212 [2025-02-06 02:43:41,429 INFO L226 Difference]: Without dead ends: 7050 [2025-02-06 02:43:41,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:43:41,436 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 1374 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 2305 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:41,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 2305 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 02:43:41,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2025-02-06 02:43:41,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 3862. [2025-02-06 02:43:41,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3862 states, 3682 states have (on average 1.6338946224877784) internal successors, (6016), 3685 states have internal predecessors, (6016), 173 states have call successors, (173), 6 states have call predecessors, (173), 6 states have return successors, (173), 170 states have call predecessors, (173), 173 states have call successors, (173) [2025-02-06 02:43:41,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 6362 transitions. [2025-02-06 02:43:41,586 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 6362 transitions. Word has length 435 [2025-02-06 02:43:41,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:41,588 INFO L471 AbstractCegarLoop]: Abstraction has 3862 states and 6362 transitions. [2025-02-06 02:43:41,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 6362 transitions. [2025-02-06 02:43:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-02-06 02:43:41,592 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:41,592 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:41,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:43:41,592 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:41,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:41,593 INFO L85 PathProgramCache]: Analyzing trace with hash -749789802, now seen corresponding path program 1 times [2025-02-06 02:43:41,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:41,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356407505] [2025-02-06 02:43:41,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:41,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:41,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-02-06 02:43:41,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-02-06 02:43:41,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:41,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:41,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:41,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:41,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356407505] [2025-02-06 02:43:41,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356407505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:41,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:41,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:43:41,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750083223] [2025-02-06 02:43:41,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:41,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:43:41,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:41,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:43:41,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:43:41,751 INFO L87 Difference]: Start difference. First operand 3862 states and 6362 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:41,925 INFO L93 Difference]: Finished difference Result 10154 states and 16662 transitions. [2025-02-06 02:43:41,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:43:41,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-02-06 02:43:41,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:41,947 INFO L225 Difference]: With dead ends: 10154 [2025-02-06 02:43:41,947 INFO L226 Difference]: Without dead ends: 6992 [2025-02-06 02:43:41,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:43:41,955 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 399 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:41,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 919 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:43:41,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6992 states. [2025-02-06 02:43:42,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6992 to 6430. [2025-02-06 02:43:42,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6430 states, 6250 states have (on average 1.61984) internal successors, (10124), 6253 states have internal predecessors, (10124), 173 states have call successors, (173), 6 states have call predecessors, (173), 6 states have return successors, (173), 170 states have call predecessors, (173), 173 states have call successors, (173) [2025-02-06 02:43:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6430 states to 6430 states and 10470 transitions. [2025-02-06 02:43:42,143 INFO L78 Accepts]: Start accepts. Automaton has 6430 states and 10470 transitions. Word has length 435 [2025-02-06 02:43:42,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:42,144 INFO L471 AbstractCegarLoop]: Abstraction has 6430 states and 10470 transitions. [2025-02-06 02:43:42,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 6430 states and 10470 transitions. [2025-02-06 02:43:42,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-02-06 02:43:42,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:42,152 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:42,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:43:42,152 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:42,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:42,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1345062359, now seen corresponding path program 1 times [2025-02-06 02:43:42,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:42,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667951023] [2025-02-06 02:43:42,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:42,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:42,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-02-06 02:43:42,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-02-06 02:43:42,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:42,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:42,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:42,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667951023] [2025-02-06 02:43:42,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667951023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:42,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:42,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:43:42,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832566287] [2025-02-06 02:43:42,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:42,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:43:42,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:42,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:43:42,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:43:42,343 INFO L87 Difference]: Start difference. First operand 6430 states and 10470 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:42,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:42,510 INFO L93 Difference]: Finished difference Result 12946 states and 21058 transitions. [2025-02-06 02:43:42,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:43:42,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-02-06 02:43:42,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:42,534 INFO L225 Difference]: With dead ends: 12946 [2025-02-06 02:43:42,535 INFO L226 Difference]: Without dead ends: 8852 [2025-02-06 02:43:42,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:43:42,545 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 423 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:42,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 999 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:43:42,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8852 states. [2025-02-06 02:43:42,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8852 to 5990. [2025-02-06 02:43:42,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5990 states, 5810 states have (on average 1.6158347676419966) internal successors, (9388), 5813 states have internal predecessors, (9388), 173 states have call successors, (173), 6 states have call predecessors, (173), 6 states have return successors, (173), 170 states have call predecessors, (173), 173 states have call successors, (173) [2025-02-06 02:43:42,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5990 states to 5990 states and 9734 transitions. [2025-02-06 02:43:42,687 INFO L78 Accepts]: Start accepts. Automaton has 5990 states and 9734 transitions. Word has length 435 [2025-02-06 02:43:42,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:42,687 INFO L471 AbstractCegarLoop]: Abstraction has 5990 states and 9734 transitions. [2025-02-06 02:43:42,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:42,688 INFO L276 IsEmpty]: Start isEmpty. Operand 5990 states and 9734 transitions. [2025-02-06 02:43:42,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-02-06 02:43:42,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:42,694 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:42,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:43:42,695 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:42,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:42,696 INFO L85 PathProgramCache]: Analyzing trace with hash 422378776, now seen corresponding path program 1 times [2025-02-06 02:43:42,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:42,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51324611] [2025-02-06 02:43:42,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:42,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:42,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-02-06 02:43:42,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-02-06 02:43:42,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:42,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:43,321 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:43,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:43,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51324611] [2025-02-06 02:43:43,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51324611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:43,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:43,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:43,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607348539] [2025-02-06 02:43:43,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:43,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:43,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:43,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:43,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:43,323 INFO L87 Difference]: Start difference. First operand 5990 states and 9734 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:43,654 INFO L93 Difference]: Finished difference Result 14478 states and 23362 transitions. [2025-02-06 02:43:43,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:43:43,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-02-06 02:43:43,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:43,676 INFO L225 Difference]: With dead ends: 14478 [2025-02-06 02:43:43,676 INFO L226 Difference]: Without dead ends: 10336 [2025-02-06 02:43:43,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:43,686 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 374 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:43,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1540 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:43:43,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10336 states. [2025-02-06 02:43:43,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10336 to 7270. [2025-02-06 02:43:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7270 states, 7090 states have (on average 1.6174894217207334) internal successors, (11468), 7093 states have internal predecessors, (11468), 173 states have call successors, (173), 6 states have call predecessors, (173), 6 states have return successors, (173), 170 states have call predecessors, (173), 173 states have call successors, (173) [2025-02-06 02:43:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7270 states to 7270 states and 11814 transitions. [2025-02-06 02:43:43,835 INFO L78 Accepts]: Start accepts. Automaton has 7270 states and 11814 transitions. Word has length 435 [2025-02-06 02:43:43,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:43,835 INFO L471 AbstractCegarLoop]: Abstraction has 7270 states and 11814 transitions. [2025-02-06 02:43:43,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:43,836 INFO L276 IsEmpty]: Start isEmpty. Operand 7270 states and 11814 transitions. [2025-02-06 02:43:43,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-02-06 02:43:43,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:43,843 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:43,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:43:43,843 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:43,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:43,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1883958775, now seen corresponding path program 1 times [2025-02-06 02:43:43,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:43,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634675800] [2025-02-06 02:43:43,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:43,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:43,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-02-06 02:43:44,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-02-06 02:43:44,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:44,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:44,819 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:44,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:44,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634675800] [2025-02-06 02:43:44,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634675800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:44,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:44,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:44,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087079898] [2025-02-06 02:43:44,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:44,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:44,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:44,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:44,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:44,821 INFO L87 Difference]: Start difference. First operand 7270 states and 11814 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:45,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:45,173 INFO L93 Difference]: Finished difference Result 15863 states and 25742 transitions. [2025-02-06 02:43:45,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:43:45,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-02-06 02:43:45,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:45,194 INFO L225 Difference]: With dead ends: 15863 [2025-02-06 02:43:45,194 INFO L226 Difference]: Without dead ends: 10481 [2025-02-06 02:43:45,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:45,206 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 968 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:45,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 1565 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:43:45,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10481 states. [2025-02-06 02:43:45,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10481 to 7158. [2025-02-06 02:43:45,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7158 states, 6978 states have (on average 1.6147893379191745) internal successors, (11268), 6981 states have internal predecessors, (11268), 173 states have call successors, (173), 6 states have call predecessors, (173), 6 states have return successors, (173), 170 states have call predecessors, (173), 173 states have call successors, (173) [2025-02-06 02:43:45,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7158 states to 7158 states and 11614 transitions. [2025-02-06 02:43:45,402 INFO L78 Accepts]: Start accepts. Automaton has 7158 states and 11614 transitions. Word has length 435 [2025-02-06 02:43:45,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:45,403 INFO L471 AbstractCegarLoop]: Abstraction has 7158 states and 11614 transitions. [2025-02-06 02:43:45,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:45,403 INFO L276 IsEmpty]: Start isEmpty. Operand 7158 states and 11614 transitions. [2025-02-06 02:43:45,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-02-06 02:43:45,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:45,413 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:45,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:43:45,413 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:45,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:45,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1051862644, now seen corresponding path program 1 times [2025-02-06 02:43:45,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:45,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745097938] [2025-02-06 02:43:45,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:45,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:45,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-02-06 02:43:45,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-02-06 02:43:45,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:45,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:46,049 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:46,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:46,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745097938] [2025-02-06 02:43:46,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745097938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:46,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:46,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:43:46,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150993855] [2025-02-06 02:43:46,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:46,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:43:46,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:46,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:43:46,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:43:46,052 INFO L87 Difference]: Start difference. First operand 7158 states and 11614 transitions. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:46,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:46,655 INFO L93 Difference]: Finished difference Result 26548 states and 42784 transitions. [2025-02-06 02:43:46,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:43:46,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-02-06 02:43:46,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:46,693 INFO L225 Difference]: With dead ends: 26548 [2025-02-06 02:43:46,693 INFO L226 Difference]: Without dead ends: 20086 [2025-02-06 02:43:46,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-02-06 02:43:46,711 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 1021 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 2193 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:46,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 2193 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:43:46,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20086 states. [2025-02-06 02:43:46,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20086 to 13856. [2025-02-06 02:43:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13856 states, 13632 states have (on average 1.6125293427230047) internal successors, (21982), 13639 states have internal predecessors, (21982), 213 states have call successors, (213), 10 states have call predecessors, (213), 10 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) [2025-02-06 02:43:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13856 states to 13856 states and 22408 transitions. [2025-02-06 02:43:46,951 INFO L78 Accepts]: Start accepts. Automaton has 13856 states and 22408 transitions. Word has length 435 [2025-02-06 02:43:46,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:46,952 INFO L471 AbstractCegarLoop]: Abstraction has 13856 states and 22408 transitions. [2025-02-06 02:43:46,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:46,952 INFO L276 IsEmpty]: Start isEmpty. Operand 13856 states and 22408 transitions. [2025-02-06 02:43:47,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-02-06 02:43:47,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:47,001 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:47,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:43:47,001 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:47,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:47,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1984870742, now seen corresponding path program 1 times [2025-02-06 02:43:47,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:47,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992020840] [2025-02-06 02:43:47,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:47,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:47,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-02-06 02:43:47,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-02-06 02:43:47,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:47,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:47,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:47,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:47,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992020840] [2025-02-06 02:43:47,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992020840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:47,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:47,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:47,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55968887] [2025-02-06 02:43:47,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:47,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:47,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:47,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:47,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:47,592 INFO L87 Difference]: Start difference. First operand 13856 states and 22408 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:48,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:48,070 INFO L93 Difference]: Finished difference Result 27288 states and 44079 transitions. [2025-02-06 02:43:48,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:43:48,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-02-06 02:43:48,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:48,100 INFO L225 Difference]: With dead ends: 27288 [2025-02-06 02:43:48,101 INFO L226 Difference]: Without dead ends: 17056 [2025-02-06 02:43:48,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:48,114 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 1069 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:48,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 1801 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:43:48,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17056 states. [2025-02-06 02:43:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17056 to 13672. [2025-02-06 02:43:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13672 states, 13448 states have (on average 1.6096073765615706) internal successors, (21646), 13455 states have internal predecessors, (21646), 213 states have call successors, (213), 10 states have call predecessors, (213), 10 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) [2025-02-06 02:43:48,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13672 states to 13672 states and 22072 transitions. [2025-02-06 02:43:48,326 INFO L78 Accepts]: Start accepts. Automaton has 13672 states and 22072 transitions. Word has length 435 [2025-02-06 02:43:48,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:48,326 INFO L471 AbstractCegarLoop]: Abstraction has 13672 states and 22072 transitions. [2025-02-06 02:43:48,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:48,327 INFO L276 IsEmpty]: Start isEmpty. Operand 13672 states and 22072 transitions. [2025-02-06 02:43:48,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-02-06 02:43:48,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:48,338 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:48,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 02:43:48,339 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:48,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:48,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1969266391, now seen corresponding path program 1 times [2025-02-06 02:43:48,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:48,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225785001] [2025-02-06 02:43:48,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:48,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:48,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-02-06 02:43:48,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-02-06 02:43:48,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:48,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:48,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:48,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225785001] [2025-02-06 02:43:48,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225785001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:48,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:48,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:48,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586221470] [2025-02-06 02:43:48,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:48,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:48,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:48,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:48,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:48,503 INFO L87 Difference]: Start difference. First operand 13672 states and 22072 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:49,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:49,024 INFO L93 Difference]: Finished difference Result 27837 states and 44825 transitions. [2025-02-06 02:43:49,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:43:49,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-02-06 02:43:49,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:49,056 INFO L225 Difference]: With dead ends: 27837 [2025-02-06 02:43:49,056 INFO L226 Difference]: Without dead ends: 15259 [2025-02-06 02:43:49,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:49,070 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 920 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:49,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 1357 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:43:49,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15259 states. [2025-02-06 02:43:49,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15259 to 7251. [2025-02-06 02:43:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7251 states, 7094 states have (on average 1.6078376092472513) internal successors, (11406), 7097 states have internal predecessors, (11406), 149 states have call successors, (149), 7 states have call predecessors, (149), 7 states have return successors, (149), 146 states have call predecessors, (149), 149 states have call successors, (149) [2025-02-06 02:43:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7251 states to 7251 states and 11704 transitions. [2025-02-06 02:43:49,277 INFO L78 Accepts]: Start accepts. Automaton has 7251 states and 11704 transitions. Word has length 435 [2025-02-06 02:43:49,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:49,279 INFO L471 AbstractCegarLoop]: Abstraction has 7251 states and 11704 transitions. [2025-02-06 02:43:49,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:49,280 INFO L276 IsEmpty]: Start isEmpty. Operand 7251 states and 11704 transitions. [2025-02-06 02:43:49,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-02-06 02:43:49,289 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:49,290 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:49,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 02:43:49,290 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:49,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:49,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1361189528, now seen corresponding path program 1 times [2025-02-06 02:43:49,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:49,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136720047] [2025-02-06 02:43:49,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:49,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:49,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-02-06 02:43:49,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-02-06 02:43:49,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:49,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:50,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:50,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:50,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136720047] [2025-02-06 02:43:50,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136720047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:50,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:50,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:50,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073100944] [2025-02-06 02:43:50,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:50,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:50,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:50,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:50,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:50,054 INFO L87 Difference]: Start difference. First operand 7251 states and 11704 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:50,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:50,326 INFO L93 Difference]: Finished difference Result 20154 states and 32454 transitions. [2025-02-06 02:43:50,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:43:50,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-02-06 02:43:50,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:50,351 INFO L225 Difference]: With dead ends: 20154 [2025-02-06 02:43:50,351 INFO L226 Difference]: Without dead ends: 13151 [2025-02-06 02:43:50,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:50,361 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 579 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:50,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1183 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:43:50,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13151 states. [2025-02-06 02:43:50,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13151 to 6955. [2025-02-06 02:43:50,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6955 states, 6798 states have (on average 1.5989997057958223) internal successors, (10870), 6801 states have internal predecessors, (10870), 149 states have call successors, (149), 7 states have call predecessors, (149), 7 states have return successors, (149), 146 states have call predecessors, (149), 149 states have call successors, (149) [2025-02-06 02:43:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6955 states to 6955 states and 11168 transitions. [2025-02-06 02:43:50,495 INFO L78 Accepts]: Start accepts. Automaton has 6955 states and 11168 transitions. Word has length 435 [2025-02-06 02:43:50,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:50,496 INFO L471 AbstractCegarLoop]: Abstraction has 6955 states and 11168 transitions. [2025-02-06 02:43:50,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:50,496 INFO L276 IsEmpty]: Start isEmpty. Operand 6955 states and 11168 transitions. [2025-02-06 02:43:50,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-02-06 02:43:50,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:50,503 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:50,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 02:43:50,503 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:50,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:50,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1262710541, now seen corresponding path program 1 times [2025-02-06 02:43:50,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:50,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069168037] [2025-02-06 02:43:50,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:50,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:50,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-02-06 02:43:50,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-02-06 02:43:50,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:50,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:51,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:51,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:51,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069168037] [2025-02-06 02:43:51,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069168037] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:51,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:51,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:51,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285028853] [2025-02-06 02:43:51,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:51,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:51,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:51,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:51,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:51,054 INFO L87 Difference]: Start difference. First operand 6955 states and 11168 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:51,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:51,350 INFO L93 Difference]: Finished difference Result 16661 states and 26704 transitions. [2025-02-06 02:43:51,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:43:51,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 436 [2025-02-06 02:43:51,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:51,369 INFO L225 Difference]: With dead ends: 16661 [2025-02-06 02:43:51,369 INFO L226 Difference]: Without dead ends: 10098 [2025-02-06 02:43:51,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:51,379 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 692 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:51,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1617 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:43:51,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10098 states. [2025-02-06 02:43:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10098 to 6915. [2025-02-06 02:43:51,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6915 states, 6758 states have (on average 1.5930748742231429) internal successors, (10766), 6761 states have internal predecessors, (10766), 149 states have call successors, (149), 7 states have call predecessors, (149), 7 states have return successors, (149), 146 states have call predecessors, (149), 149 states have call successors, (149) [2025-02-06 02:43:51,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6915 states to 6915 states and 11064 transitions. [2025-02-06 02:43:51,494 INFO L78 Accepts]: Start accepts. Automaton has 6915 states and 11064 transitions. Word has length 436 [2025-02-06 02:43:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:51,494 INFO L471 AbstractCegarLoop]: Abstraction has 6915 states and 11064 transitions. [2025-02-06 02:43:51,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:51,494 INFO L276 IsEmpty]: Start isEmpty. Operand 6915 states and 11064 transitions. [2025-02-06 02:43:51,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-02-06 02:43:51,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:51,500 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:51,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 02:43:51,500 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:51,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:51,501 INFO L85 PathProgramCache]: Analyzing trace with hash 878008305, now seen corresponding path program 1 times [2025-02-06 02:43:51,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:51,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146088114] [2025-02-06 02:43:51,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:51,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:51,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-02-06 02:43:51,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-02-06 02:43:51,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:51,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:52,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:52,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146088114] [2025-02-06 02:43:52,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146088114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:52,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:52,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:43:52,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303104985] [2025-02-06 02:43:52,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:52,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:43:52,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:52,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:43:52,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:52,425 INFO L87 Difference]: Start difference. First operand 6915 states and 11064 transitions. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:52,984 INFO L93 Difference]: Finished difference Result 15900 states and 25249 transitions. [2025-02-06 02:43:52,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:43:52,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 436 [2025-02-06 02:43:52,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:53,006 INFO L225 Difference]: With dead ends: 15900 [2025-02-06 02:43:53,006 INFO L226 Difference]: Without dead ends: 12129 [2025-02-06 02:43:53,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:43:53,013 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 661 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:53,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1563 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:43:53,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12129 states. [2025-02-06 02:43:53,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12129 to 9528. [2025-02-06 02:43:53,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9528 states, 9324 states have (on average 1.5915915915915917) internal successors, (14840), 9331 states have internal predecessors, (14840), 191 states have call successors, (191), 12 states have call predecessors, (191), 12 states have return successors, (191), 184 states have call predecessors, (191), 191 states have call successors, (191) [2025-02-06 02:43:53,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9528 states to 9528 states and 15222 transitions. [2025-02-06 02:43:53,253 INFO L78 Accepts]: Start accepts. Automaton has 9528 states and 15222 transitions. Word has length 436 [2025-02-06 02:43:53,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:53,253 INFO L471 AbstractCegarLoop]: Abstraction has 9528 states and 15222 transitions. [2025-02-06 02:43:53,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 9528 states and 15222 transitions. [2025-02-06 02:43:53,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-02-06 02:43:53,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:53,263 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:53,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 02:43:53,264 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:53,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:53,264 INFO L85 PathProgramCache]: Analyzing trace with hash 951965298, now seen corresponding path program 1 times [2025-02-06 02:43:53,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:53,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983676524] [2025-02-06 02:43:53,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:53,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:53,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-02-06 02:43:53,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-02-06 02:43:53,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:53,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:53,879 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:53,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:53,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983676524] [2025-02-06 02:43:53,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983676524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:53,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:53,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:53,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763599668] [2025-02-06 02:43:53,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:53,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:53,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:53,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:53,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:53,881 INFO L87 Difference]: Start difference. First operand 9528 states and 15222 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:54,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:54,376 INFO L93 Difference]: Finished difference Result 16290 states and 25993 transitions. [2025-02-06 02:43:54,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:43:54,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 436 [2025-02-06 02:43:54,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:54,396 INFO L225 Difference]: With dead ends: 16290 [2025-02-06 02:43:54,396 INFO L226 Difference]: Without dead ends: 10784 [2025-02-06 02:43:54,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:54,405 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 418 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:54,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1459 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:43:54,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10784 states. [2025-02-06 02:43:54,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10784 to 9584. [2025-02-06 02:43:54,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9584 states, 9380 states have (on average 1.5918976545842218) internal successors, (14932), 9387 states have internal predecessors, (14932), 191 states have call successors, (191), 12 states have call predecessors, (191), 12 states have return successors, (191), 184 states have call predecessors, (191), 191 states have call successors, (191) [2025-02-06 02:43:54,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9584 states to 9584 states and 15314 transitions. [2025-02-06 02:43:54,597 INFO L78 Accepts]: Start accepts. Automaton has 9584 states and 15314 transitions. Word has length 436 [2025-02-06 02:43:54,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:54,597 INFO L471 AbstractCegarLoop]: Abstraction has 9584 states and 15314 transitions. [2025-02-06 02:43:54,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 9584 states and 15314 transitions. [2025-02-06 02:43:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-02-06 02:43:54,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:54,605 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:54,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 02:43:54,606 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:54,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:54,607 INFO L85 PathProgramCache]: Analyzing trace with hash -3555981, now seen corresponding path program 1 times [2025-02-06 02:43:54,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:54,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646577300] [2025-02-06 02:43:54,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:54,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:54,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-02-06 02:43:54,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-02-06 02:43:54,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:54,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:54,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:54,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646577300] [2025-02-06 02:43:54,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646577300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:54,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:54,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:43:54,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550766465] [2025-02-06 02:43:54,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:54,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:43:54,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:54,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:43:54,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:43:54,756 INFO L87 Difference]: Start difference. First operand 9584 states and 15314 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:54,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:54,909 INFO L93 Difference]: Finished difference Result 16544 states and 26425 transitions. [2025-02-06 02:43:54,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:43:54,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 436 [2025-02-06 02:43:54,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:54,928 INFO L225 Difference]: With dead ends: 16544 [2025-02-06 02:43:54,928 INFO L226 Difference]: Without dead ends: 9600 [2025-02-06 02:43:54,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:43:54,936 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 213 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:54,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1070 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:43:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9600 states. [2025-02-06 02:43:55,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9600 to 6550. [2025-02-06 02:43:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6550 states, 6387 states have (on average 1.5855644277438548) internal successors, (10127), 6390 states have internal predecessors, (10127), 151 states have call successors, (151), 11 states have call predecessors, (151), 11 states have return successors, (151), 148 states have call predecessors, (151), 151 states have call successors, (151) [2025-02-06 02:43:55,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6550 states to 6550 states and 10429 transitions. [2025-02-06 02:43:55,217 INFO L78 Accepts]: Start accepts. Automaton has 6550 states and 10429 transitions. Word has length 436 [2025-02-06 02:43:55,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:55,217 INFO L471 AbstractCegarLoop]: Abstraction has 6550 states and 10429 transitions. [2025-02-06 02:43:55,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:55,218 INFO L276 IsEmpty]: Start isEmpty. Operand 6550 states and 10429 transitions. [2025-02-06 02:43:55,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-02-06 02:43:55,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:55,224 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:55,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 02:43:55,225 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:55,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:55,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1400786480, now seen corresponding path program 1 times [2025-02-06 02:43:55,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:55,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105176565] [2025-02-06 02:43:55,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:55,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:55,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-02-06 02:43:55,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-02-06 02:43:55,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:55,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:56,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:56,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:56,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105176565] [2025-02-06 02:43:56,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105176565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:56,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:56,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:56,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189474308] [2025-02-06 02:43:56,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:56,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:56,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:56,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:56,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:56,070 INFO L87 Difference]: Start difference. First operand 6550 states and 10429 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:56,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:56,307 INFO L93 Difference]: Finished difference Result 13120 states and 20934 transitions. [2025-02-06 02:43:56,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:43:56,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 437 [2025-02-06 02:43:56,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:56,325 INFO L225 Difference]: With dead ends: 13120 [2025-02-06 02:43:56,326 INFO L226 Difference]: Without dead ends: 7798 [2025-02-06 02:43:56,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:56,332 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 510 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:56,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 939 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:43:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7798 states. [2025-02-06 02:43:56,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7798 to 4490. [2025-02-06 02:43:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4490 states, 4344 states have (on average 1.5587016574585635) internal successors, (6771), 4345 states have internal predecessors, (6771), 133 states have call successors, (133), 12 states have call predecessors, (133), 12 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-02-06 02:43:56,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4490 states to 4490 states and 7037 transitions. [2025-02-06 02:43:56,426 INFO L78 Accepts]: Start accepts. Automaton has 4490 states and 7037 transitions. Word has length 437 [2025-02-06 02:43:56,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:56,427 INFO L471 AbstractCegarLoop]: Abstraction has 4490 states and 7037 transitions. [2025-02-06 02:43:56,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:56,427 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 7037 transitions. [2025-02-06 02:43:56,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-02-06 02:43:56,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:56,430 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:56,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 02:43:56,431 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:56,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:56,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1597535663, now seen corresponding path program 1 times [2025-02-06 02:43:56,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:56,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141600790] [2025-02-06 02:43:56,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:56,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:56,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-02-06 02:43:56,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-02-06 02:43:56,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:56,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:57,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:57,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141600790] [2025-02-06 02:43:57,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141600790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:57,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:57,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:43:57,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683333965] [2025-02-06 02:43:57,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:57,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:43:57,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:57,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:43:57,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:43:57,253 INFO L87 Difference]: Start difference. First operand 4490 states and 7037 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:57,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:57,907 INFO L93 Difference]: Finished difference Result 12060 states and 18937 transitions. [2025-02-06 02:43:57,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:43:57,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 437 [2025-02-06 02:43:57,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:57,924 INFO L225 Difference]: With dead ends: 12060 [2025-02-06 02:43:57,924 INFO L226 Difference]: Without dead ends: 8952 [2025-02-06 02:43:57,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:43:57,933 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 1146 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:57,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 1914 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:43:57,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8952 states. [2025-02-06 02:43:58,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8952 to 5690. [2025-02-06 02:43:58,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5690 states, 5544 states have (on average 1.5604256854256855) internal successors, (8651), 5545 states have internal predecessors, (8651), 133 states have call successors, (133), 12 states have call predecessors, (133), 12 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-02-06 02:43:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5690 states to 5690 states and 8917 transitions. [2025-02-06 02:43:58,092 INFO L78 Accepts]: Start accepts. Automaton has 5690 states and 8917 transitions. Word has length 437 [2025-02-06 02:43:58,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:58,093 INFO L471 AbstractCegarLoop]: Abstraction has 5690 states and 8917 transitions. [2025-02-06 02:43:58,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:58,093 INFO L276 IsEmpty]: Start isEmpty. Operand 5690 states and 8917 transitions. [2025-02-06 02:43:58,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-02-06 02:43:58,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:58,099 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:58,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 02:43:58,099 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:58,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:58,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1444296718, now seen corresponding path program 1 times [2025-02-06 02:43:58,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:58,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956837427] [2025-02-06 02:43:58,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:58,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:58,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-02-06 02:43:58,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-02-06 02:43:58,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:58,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:58,744 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:58,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:58,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956837427] [2025-02-06 02:43:58,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956837427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:58,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:58,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:43:58,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113959708] [2025-02-06 02:43:58,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:58,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:43:58,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:58,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:43:58,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:58,746 INFO L87 Difference]: Start difference. First operand 5690 states and 8917 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:59,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:59,110 INFO L93 Difference]: Finished difference Result 10020 states and 15715 transitions. [2025-02-06 02:43:59,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:43:59,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 437 [2025-02-06 02:43:59,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:59,120 INFO L225 Difference]: With dead ends: 10020 [2025-02-06 02:43:59,120 INFO L226 Difference]: Without dead ends: 6756 [2025-02-06 02:43:59,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:43:59,125 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 459 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:59,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1628 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:43:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6756 states. [2025-02-06 02:43:59,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6756 to 6753. [2025-02-06 02:43:59,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6753 states, 6568 states have (on average 1.5552679658952497) internal successors, (10215), 6570 states have internal predecessors, (10215), 168 states have call successors, (168), 16 states have call predecessors, (168), 16 states have return successors, (168), 166 states have call predecessors, (168), 168 states have call successors, (168) [2025-02-06 02:43:59,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6753 states to 6753 states and 10551 transitions. [2025-02-06 02:43:59,306 INFO L78 Accepts]: Start accepts. Automaton has 6753 states and 10551 transitions. Word has length 437 [2025-02-06 02:43:59,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:59,307 INFO L471 AbstractCegarLoop]: Abstraction has 6753 states and 10551 transitions. [2025-02-06 02:43:59,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:59,307 INFO L276 IsEmpty]: Start isEmpty. Operand 6753 states and 10551 transitions. [2025-02-06 02:43:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-02-06 02:43:59,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:59,313 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:43:59,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 02:43:59,314 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:59,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:59,314 INFO L85 PathProgramCache]: Analyzing trace with hash 766812528, now seen corresponding path program 1 times [2025-02-06 02:43:59,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:59,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672077829] [2025-02-06 02:43:59,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:59,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:59,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-02-06 02:44:00,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-02-06 02:44:00,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:00,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3 proven. 174 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-02-06 02:44:00,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:44:00,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672077829] [2025-02-06 02:44:00,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672077829] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:44:00,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760224756] [2025-02-06 02:44:00,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:00,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:44:00,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:44:00,626 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:44:00,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:44:00,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-02-06 02:44:00,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-02-06 02:44:00,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:00,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:00,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:44:00,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:44:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3293 proven. 114 refuted. 0 times theorem prover too weak. 3673 trivial. 0 not checked. [2025-02-06 02:44:01,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:44:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 63 proven. 114 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-02-06 02:44:01,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760224756] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:44:01,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:44:01,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2025-02-06 02:44:01,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502140023] [2025-02-06 02:44:01,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:44:01,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 02:44:01,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:44:01,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 02:44:01,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:44:01,799 INFO L87 Difference]: Start difference. First operand 6753 states and 10551 transitions. Second operand has 13 states, 13 states have (on average 24.53846153846154) internal successors, (319), 13 states have internal predecessors, (319), 5 states have call successors, (158), 2 states have call predecessors, (158), 4 states have return successors, (159), 5 states have call predecessors, (159), 5 states have call successors, (159) [2025-02-06 02:44:03,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:44:03,226 INFO L93 Difference]: Finished difference Result 13599 states and 21206 transitions. [2025-02-06 02:44:03,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 02:44:03,226 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 24.53846153846154) internal successors, (319), 13 states have internal predecessors, (319), 5 states have call successors, (158), 2 states have call predecessors, (158), 4 states have return successors, (159), 5 states have call predecessors, (159), 5 states have call successors, (159) Word has length 437 [2025-02-06 02:44:03,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:44:03,237 INFO L225 Difference]: With dead ends: 13599 [2025-02-06 02:44:03,237 INFO L226 Difference]: Without dead ends: 6978 [2025-02-06 02:44:03,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 899 GetRequests, 873 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-02-06 02:44:03,245 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 1159 mSDsluCounter, 2089 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 2422 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:44:03,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 2422 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 02:44:03,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6978 states. [2025-02-06 02:44:03,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6978 to 6769. [2025-02-06 02:44:03,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6769 states, 6580 states have (on average 1.5322188449848024) internal successors, (10082), 6582 states have internal predecessors, (10082), 168 states have call successors, (168), 20 states have call predecessors, (168), 20 states have return successors, (168), 166 states have call predecessors, (168), 168 states have call successors, (168) [2025-02-06 02:44:03,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6769 states to 6769 states and 10418 transitions. [2025-02-06 02:44:03,475 INFO L78 Accepts]: Start accepts. Automaton has 6769 states and 10418 transitions. Word has length 437 [2025-02-06 02:44:03,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:44:03,476 INFO L471 AbstractCegarLoop]: Abstraction has 6769 states and 10418 transitions. [2025-02-06 02:44:03,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 24.53846153846154) internal successors, (319), 13 states have internal predecessors, (319), 5 states have call successors, (158), 2 states have call predecessors, (158), 4 states have return successors, (159), 5 states have call predecessors, (159), 5 states have call successors, (159) [2025-02-06 02:44:03,476 INFO L276 IsEmpty]: Start isEmpty. Operand 6769 states and 10418 transitions. [2025-02-06 02:44:03,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-02-06 02:44:03,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:44:03,482 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:44:03,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 02:44:03,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:44:03,683 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:44:03,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:44:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash 615685318, now seen corresponding path program 1 times [2025-02-06 02:44:03,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:44:03,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565838153] [2025-02-06 02:44:03,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:03,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:44:03,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-02-06 02:44:04,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-02-06 02:44:04,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:04,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 36 proven. 141 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-02-06 02:44:04,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:44:04,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565838153] [2025-02-06 02:44:04,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565838153] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:44:04,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014031852] [2025-02-06 02:44:04,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:04,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:44:04,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:44:04,641 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:44:04,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 02:44:04,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-02-06 02:44:04,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-02-06 02:44:04,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:04,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:04,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 02:44:04,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:44:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3557 proven. 78 refuted. 0 times theorem prover too weak. 3445 trivial. 0 not checked. [2025-02-06 02:44:05,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:44:05,466 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 99 proven. 78 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-02-06 02:44:05,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014031852] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:44:05,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:44:05,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2025-02-06 02:44:05,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159706482] [2025-02-06 02:44:05,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:44:05,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 02:44:05,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:44:05,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 02:44:05,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:44:05,469 INFO L87 Difference]: Start difference. First operand 6769 states and 10418 transitions. Second operand has 13 states, 13 states have (on average 21.692307692307693) internal successors, (282), 13 states have internal predecessors, (282), 4 states have call successors, (133), 2 states have call predecessors, (133), 4 states have return successors, (135), 4 states have call predecessors, (135), 4 states have call successors, (135) [2025-02-06 02:44:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:44:06,190 INFO L93 Difference]: Finished difference Result 10571 states and 16292 transitions. [2025-02-06 02:44:06,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 02:44:06,194 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 21.692307692307693) internal successors, (282), 13 states have internal predecessors, (282), 4 states have call successors, (133), 2 states have call predecessors, (133), 4 states have return successors, (135), 4 states have call predecessors, (135), 4 states have call successors, (135) Word has length 438 [2025-02-06 02:44:06,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:44:06,201 INFO L225 Difference]: With dead ends: 10571 [2025-02-06 02:44:06,202 INFO L226 Difference]: Without dead ends: 4188 [2025-02-06 02:44:06,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 895 GetRequests, 870 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2025-02-06 02:44:06,208 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 1050 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:44:06,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 1588 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:44:06,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2025-02-06 02:44:06,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 2475. [2025-02-06 02:44:06,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2475 states, 2337 states have (on average 1.5143346170303809) internal successors, (3539), 2337 states have internal predecessors, (3539), 120 states have call successors, (120), 17 states have call predecessors, (120), 17 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-02-06 02:44:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3779 transitions. [2025-02-06 02:44:06,285 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3779 transitions. Word has length 438 [2025-02-06 02:44:06,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:44:06,285 INFO L471 AbstractCegarLoop]: Abstraction has 2475 states and 3779 transitions. [2025-02-06 02:44:06,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 21.692307692307693) internal successors, (282), 13 states have internal predecessors, (282), 4 states have call successors, (133), 2 states have call predecessors, (133), 4 states have return successors, (135), 4 states have call predecessors, (135), 4 states have call successors, (135) [2025-02-06 02:44:06,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3779 transitions. [2025-02-06 02:44:06,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-02-06 02:44:06,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:44:06,288 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:44:06,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 02:44:06,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:44:06,489 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:44:06,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:44:06,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1726718390, now seen corresponding path program 1 times [2025-02-06 02:44:06,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:44:06,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758912495] [2025-02-06 02:44:06,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:06,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:44:06,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-02-06 02:44:06,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-02-06 02:44:06,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:06,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:06,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:44:06,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:44:06,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758912495] [2025-02-06 02:44:06,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758912495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:44:06,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:44:06,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:44:06,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692106509] [2025-02-06 02:44:06,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:44:06,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:44:06,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:44:06,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:44:06,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:44:06,632 INFO L87 Difference]: Start difference. First operand 2475 states and 3779 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:44:06,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:44:06,785 INFO L93 Difference]: Finished difference Result 4522 states and 6922 transitions. [2025-02-06 02:44:06,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:44:06,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 438 [2025-02-06 02:44:06,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:44:06,794 INFO L225 Difference]: With dead ends: 4522 [2025-02-06 02:44:06,795 INFO L226 Difference]: Without dead ends: 2961 [2025-02-06 02:44:06,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:44:06,797 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 203 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:44:06,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 934 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:44:06,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2025-02-06 02:44:06,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 2755. [2025-02-06 02:44:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2755 states, 2617 states have (on average 1.5051585785250288) internal successors, (3939), 2617 states have internal predecessors, (3939), 120 states have call successors, (120), 17 states have call predecessors, (120), 17 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-02-06 02:44:06,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 4179 transitions. [2025-02-06 02:44:06,912 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 4179 transitions. Word has length 438 [2025-02-06 02:44:06,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:44:06,913 INFO L471 AbstractCegarLoop]: Abstraction has 2755 states and 4179 transitions. [2025-02-06 02:44:06,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:44:06,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 4179 transitions. [2025-02-06 02:44:06,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-02-06 02:44:06,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:44:06,917 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:44:06,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 02:44:06,917 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:44:06,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:44:06,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1308943764, now seen corresponding path program 1 times [2025-02-06 02:44:06,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:44:06,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282931112] [2025-02-06 02:44:06,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:06,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:44:06,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-02-06 02:44:07,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-02-06 02:44:07,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:07,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:44:07,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:44:07,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282931112] [2025-02-06 02:44:07,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282931112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:44:07,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:44:07,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:44:07,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875947676] [2025-02-06 02:44:07,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:44:07,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:44:07,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:44:07,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:44:07,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:44:07,863 INFO L87 Difference]: Start difference. First operand 2755 states and 4179 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:44:08,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:44:08,624 INFO L93 Difference]: Finished difference Result 9102 states and 13843 transitions. [2025-02-06 02:44:08,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:44:08,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 439 [2025-02-06 02:44:08,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:44:08,635 INFO L225 Difference]: With dead ends: 9102 [2025-02-06 02:44:08,635 INFO L226 Difference]: Without dead ends: 7585 [2025-02-06 02:44:08,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:44:08,638 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 1882 mSDsluCounter, 2270 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1882 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:44:08,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1882 Valid, 2929 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:44:08,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7585 states. [2025-02-06 02:44:08,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7585 to 3083. [2025-02-06 02:44:08,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3083 states, 2945 states have (on average 1.500509337860781) internal successors, (4419), 2945 states have internal predecessors, (4419), 120 states have call successors, (120), 17 states have call predecessors, (120), 17 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-02-06 02:44:08,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 4659 transitions. [2025-02-06 02:44:08,726 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 4659 transitions. Word has length 439 [2025-02-06 02:44:08,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:44:08,726 INFO L471 AbstractCegarLoop]: Abstraction has 3083 states and 4659 transitions. [2025-02-06 02:44:08,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:44:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 4659 transitions. [2025-02-06 02:44:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-02-06 02:44:08,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:44:08,729 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:44:08,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 02:44:08,729 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:44:08,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:44:08,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1208031797, now seen corresponding path program 1 times [2025-02-06 02:44:08,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:44:08,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230102354] [2025-02-06 02:44:08,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:08,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:44:08,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-02-06 02:44:08,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-02-06 02:44:08,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:08,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:44:09,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:44:09,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230102354] [2025-02-06 02:44:09,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230102354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:44:09,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:44:09,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:44:09,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874282898] [2025-02-06 02:44:09,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:44:09,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:44:09,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:44:09,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:44:09,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:44:09,299 INFO L87 Difference]: Start difference. First operand 3083 states and 4659 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:44:09,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:44:09,586 INFO L93 Difference]: Finished difference Result 6413 states and 9728 transitions. [2025-02-06 02:44:09,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:44:09,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 439 [2025-02-06 02:44:09,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:44:09,594 INFO L225 Difference]: With dead ends: 6413 [2025-02-06 02:44:09,595 INFO L226 Difference]: Without dead ends: 4588 [2025-02-06 02:44:09,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:44:09,598 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 849 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:44:09,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1154 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:44:09,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4588 states. [2025-02-06 02:44:09,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4588 to 3475. [2025-02-06 02:44:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3475 states, 3337 states have (on average 1.503446209169913) internal successors, (5017), 3337 states have internal predecessors, (5017), 120 states have call successors, (120), 17 states have call predecessors, (120), 17 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-02-06 02:44:09,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3475 states to 3475 states and 5257 transitions. [2025-02-06 02:44:09,681 INFO L78 Accepts]: Start accepts. Automaton has 3475 states and 5257 transitions. Word has length 439 [2025-02-06 02:44:09,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:44:09,681 INFO L471 AbstractCegarLoop]: Abstraction has 3475 states and 5257 transitions. [2025-02-06 02:44:09,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:44:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3475 states and 5257 transitions. [2025-02-06 02:44:09,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-02-06 02:44:09,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:44:09,684 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:44:09,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 02:44:09,685 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:44:09,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:44:09,685 INFO L85 PathProgramCache]: Analyzing trace with hash 303857412, now seen corresponding path program 1 times [2025-02-06 02:44:09,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:44:09,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113727245] [2025-02-06 02:44:09,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:09,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:44:09,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-02-06 02:44:09,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-02-06 02:44:09,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:09,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:44:10,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:44:10,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:44:10,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113727245] [2025-02-06 02:44:10,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113727245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:44:10,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:44:10,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:44:10,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740175618] [2025-02-06 02:44:10,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:44:10,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:44:10,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:44:10,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:44:10,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:44:10,152 INFO L87 Difference]: Start difference. First operand 3475 states and 5257 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:44:10,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:44:10,616 INFO L93 Difference]: Finished difference Result 6585 states and 9933 transitions. [2025-02-06 02:44:10,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:44:10,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 439 [2025-02-06 02:44:10,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:44:10,623 INFO L225 Difference]: With dead ends: 6585 [2025-02-06 02:44:10,623 INFO L226 Difference]: Without dead ends: 3958 [2025-02-06 02:44:10,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:44:10,626 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 606 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:44:10,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 2501 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:44:10,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3958 states. [2025-02-06 02:44:10,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3958 to 3019. [2025-02-06 02:44:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 2881 states have (on average 1.455397431447414) internal successors, (4193), 2881 states have internal predecessors, (4193), 120 states have call successors, (120), 17 states have call predecessors, (120), 17 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-02-06 02:44:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 4433 transitions. [2025-02-06 02:44:10,723 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 4433 transitions. Word has length 439 [2025-02-06 02:44:10,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:44:10,723 INFO L471 AbstractCegarLoop]: Abstraction has 3019 states and 4433 transitions. [2025-02-06 02:44:10,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:44:10,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 4433 transitions. [2025-02-06 02:44:10,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-02-06 02:44:10,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:44:10,725 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:44:10,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 02:44:10,726 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:44:10,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:44:10,726 INFO L85 PathProgramCache]: Analyzing trace with hash -720836509, now seen corresponding path program 1 times [2025-02-06 02:44:10,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:44:10,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349057863] [2025-02-06 02:44:10,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:10,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:44:10,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-02-06 02:44:11,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-02-06 02:44:11,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:44:11,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat