./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-9.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_amount250_file-9.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 b3c86227bd3c166c2c8d2c3f7201460a37b3a8cc1b1724af153204475ecb73cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:23:18,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:23:18,204 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:23:18,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:23:18,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:23:18,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:23:18,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:23:18,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:23:18,231 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:23:18,231 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:23:18,231 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:23:18,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:23:18,232 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:23:18,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:23:18,232 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:23:18,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:23:18,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:23:18,233 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:23:18,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:23:18,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:23:18,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:23:18,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:23:18,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:23:18,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:23:18,234 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:23:18,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:23:18,234 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:23:18,234 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:23:18,234 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:23:18,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:23:18,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:23:18,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:23:18,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:23:18,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:23:18,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:23:18,235 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:23:18,235 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:23:18,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:23:18,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:23:18,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:23:18,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:23:18,235 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:23:18,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:23:18,236 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 -> b3c86227bd3c166c2c8d2c3f7201460a37b3a8cc1b1724af153204475ecb73cc [2025-02-06 02:23:18,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:23:18,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:23:18,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:23:18,467 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:23:18,467 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:23:18,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-9.i [2025-02-06 02:23:19,645 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/584537705/cc3948966d8548e88a53d5f1e2571750/FLAGa3bcb6ad9 [2025-02-06 02:23:19,895 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:23:19,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-9.i [2025-02-06 02:23:19,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/584537705/cc3948966d8548e88a53d5f1e2571750/FLAGa3bcb6ad9 [2025-02-06 02:23:20,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/584537705/cc3948966d8548e88a53d5f1e2571750 [2025-02-06 02:23:20,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:23:20,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:23:20,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:23:20,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:23:20,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:23:20,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53333e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20, skipping insertion in model container [2025-02-06 02:23:20,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:23:20,318 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_amount250_file-9.i[915,928] [2025-02-06 02:23:20,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:23:20,421 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:23:20,430 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_amount250_file-9.i[915,928] [2025-02-06 02:23:20,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:23:20,503 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:23:20,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20 WrapperNode [2025-02-06 02:23:20,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:23:20,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:23:20,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:23:20,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:23:20,509 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:23:20" (1/1) ... [2025-02-06 02:23:20,523 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:23:20" (1/1) ... [2025-02-06 02:23:20,577 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 416 [2025-02-06 02:23:20,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:23:20,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:23:20,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:23:20,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:23:20,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,596 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,616 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:23:20,617 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,635 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:23:20,659 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:23:20,659 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:23:20,659 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:23:20,660 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (1/1) ... [2025-02-06 02:23:20,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:23:20,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:23:20,689 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:23:20,697 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:23:20,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:23:20,714 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:23:20,714 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:23:20,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:23:20,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:23:20,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:23:20,797 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:23:20,799 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:23:21,432 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L367: havoc property_#t~ite35#1;havoc property_#t~ite34#1;havoc property_#t~bitwise33#1;havoc property_#t~short36#1;havoc property_#t~ite38#1;havoc property_#t~bitwise37#1;havoc property_#t~short39#1; [2025-02-06 02:23:21,480 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-02-06 02:23:21,480 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:23:21,505 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:23:21,505 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:23:21,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:23:21 BoogieIcfgContainer [2025-02-06 02:23:21,506 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:23:21,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:23:21,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:23:21,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:23:21,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:23:20" (1/3) ... [2025-02-06 02:23:21,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba01b4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:23:21, skipping insertion in model container [2025-02-06 02:23:21,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:23:20" (2/3) ... [2025-02-06 02:23:21,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba01b4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:23:21, skipping insertion in model container [2025-02-06 02:23:21,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:23:21" (3/3) ... [2025-02-06 02:23:21,514 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-9.i [2025-02-06 02:23:21,526 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:23:21,528 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-9.i that has 2 procedures, 176 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:23:21,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:23:21,583 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;@2e7a0d71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:23:21,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:23:21,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 176 states, 125 states have (on average 1.512) internal successors, (189), 126 states have internal predecessors, (189), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 02:23:21,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-02-06 02:23:21,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:21,607 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:21,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:21,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:21,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1839483890, now seen corresponding path program 1 times [2025-02-06 02:23:21,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:21,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047083685] [2025-02-06 02:23:21,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:21,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:21,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-06 02:23:21,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-06 02:23:21,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:21,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:21,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-02-06 02:23:21,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:21,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047083685] [2025-02-06 02:23:21,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047083685] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:23:21,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601182529] [2025-02-06 02:23:21,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:21,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:23:21,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:23:22,003 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:23:22,009 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:23:22,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-06 02:23:22,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-06 02:23:22,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:22,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:22,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:23:22,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:23:22,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-02-06 02:23:22,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:23:22,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601182529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:22,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:23:22,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:23:22,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004830811] [2025-02-06 02:23:22,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:22,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:23:22,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:22,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:23:22,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:23:22,349 INFO L87 Difference]: Start difference. First operand has 176 states, 125 states have (on average 1.512) internal successors, (189), 126 states have internal predecessors, (189), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-06 02:23:22,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:22,393 INFO L93 Difference]: Finished difference Result 346 states and 613 transitions. [2025-02-06 02:23:22,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:23:22,396 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 312 [2025-02-06 02:23:22,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:22,401 INFO L225 Difference]: With dead ends: 346 [2025-02-06 02:23:22,401 INFO L226 Difference]: Without dead ends: 173 [2025-02-06 02:23:22,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 313 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:23:22,406 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:22,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 276 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:23:22,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-06 02:23:22,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-02-06 02:23:22,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 123 states have (on average 1.4959349593495934) internal successors, (184), 123 states have internal predecessors, (184), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 02:23:22,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 280 transitions. [2025-02-06 02:23:22,452 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 280 transitions. Word has length 312 [2025-02-06 02:23:22,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:22,453 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 280 transitions. [2025-02-06 02:23:22,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-06 02:23:22,453 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 280 transitions. [2025-02-06 02:23:22,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-02-06 02:23:22,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:22,457 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:22,465 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:23:22,662 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:23:22,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:22,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:22,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1208592716, now seen corresponding path program 1 times [2025-02-06 02:23:22,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:22,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533338924] [2025-02-06 02:23:22,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:22,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:22,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-06 02:23:22,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-06 02:23:22,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:22,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:22,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 02:23:23,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:23,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533338924] [2025-02-06 02:23:23,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533338924] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:23,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:23,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:23:23,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310177409] [2025-02-06 02:23:23,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:23,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:23:23,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:23,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:23:23,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:23:23,002 INFO L87 Difference]: Start difference. First operand 173 states and 280 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 02:23:23,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:23,105 INFO L93 Difference]: Finished difference Result 476 states and 771 transitions. [2025-02-06 02:23:23,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:23:23,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 312 [2025-02-06 02:23:23,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:23,110 INFO L225 Difference]: With dead ends: 476 [2025-02-06 02:23:23,110 INFO L226 Difference]: Without dead ends: 306 [2025-02-06 02:23:23,111 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:23:23,111 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 214 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:23,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 558 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:23:23,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-06 02:23:23,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 303. [2025-02-06 02:23:23,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 216 states have (on average 1.4907407407407407) internal successors, (322), 217 states have internal predecessors, (322), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 02:23:23,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 490 transitions. [2025-02-06 02:23:23,141 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 490 transitions. Word has length 312 [2025-02-06 02:23:23,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:23,143 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 490 transitions. [2025-02-06 02:23:23,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 02:23:23,143 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 490 transitions. [2025-02-06 02:23:23,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-02-06 02:23:23,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:23,150 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:23,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:23:23,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:23,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:23,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1559392653, now seen corresponding path program 1 times [2025-02-06 02:23:23,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:23,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631153004] [2025-02-06 02:23:23,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:23,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:23,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-06 02:23:23,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-06 02:23:23,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:23,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 02:23:23,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:23,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631153004] [2025-02-06 02:23:23,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631153004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:23,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:23,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:23:23,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552907387] [2025-02-06 02:23:23,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:23,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:23:23,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:23,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:23:23,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:23:23,413 INFO L87 Difference]: Start difference. First operand 303 states and 490 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 02:23:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:23,467 INFO L93 Difference]: Finished difference Result 610 states and 982 transitions. [2025-02-06 02:23:23,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:23:23,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 312 [2025-02-06 02:23:23,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:23,470 INFO L225 Difference]: With dead ends: 610 [2025-02-06 02:23:23,470 INFO L226 Difference]: Without dead ends: 310 [2025-02-06 02:23:23,471 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:23:23,472 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 200 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:23,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 710 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:23:23,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-06 02:23:23,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 196. [2025-02-06 02:23:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 145 states have (on average 1.4827586206896552) internal successors, (215), 145 states have internal predecessors, (215), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 02:23:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 311 transitions. [2025-02-06 02:23:23,495 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 311 transitions. Word has length 312 [2025-02-06 02:23:23,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:23,496 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 311 transitions. [2025-02-06 02:23:23,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 02:23:23,496 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 311 transitions. [2025-02-06 02:23:23,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-02-06 02:23:23,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:23,500 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:23,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:23:23,501 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:23,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:23,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1134658223, now seen corresponding path program 1 times [2025-02-06 02:23:23,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:23,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53876510] [2025-02-06 02:23:23,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:23,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:23,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-02-06 02:23:23,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-02-06 02:23:23,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:23,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:23,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 02:23:23,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:23,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53876510] [2025-02-06 02:23:23,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53876510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:23,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:23,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:23:23,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510478537] [2025-02-06 02:23:23,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:23,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:23:23,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:23,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:23:23,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:23:23,745 INFO L87 Difference]: Start difference. First operand 196 states and 311 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 02:23:23,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:23,853 INFO L93 Difference]: Finished difference Result 582 states and 927 transitions. [2025-02-06 02:23:23,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:23:23,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 313 [2025-02-06 02:23:23,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:23,856 INFO L225 Difference]: With dead ends: 582 [2025-02-06 02:23:23,856 INFO L226 Difference]: Without dead ends: 389 [2025-02-06 02:23:23,857 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:23:23,858 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 246 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:23,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 660 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:23:23,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-02-06 02:23:23,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 248. [2025-02-06 02:23:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 197 states have (on average 1.5076142131979695) internal successors, (297), 197 states have internal predecessors, (297), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 02:23:23,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 393 transitions. [2025-02-06 02:23:23,881 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 393 transitions. Word has length 313 [2025-02-06 02:23:23,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:23,882 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 393 transitions. [2025-02-06 02:23:23,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 02:23:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 393 transitions. [2025-02-06 02:23:23,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-02-06 02:23:23,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:23,887 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:23,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:23:23,887 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:23,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:23,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1466120770, now seen corresponding path program 1 times [2025-02-06 02:23:23,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:23,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25775181] [2025-02-06 02:23:23,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:23,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:23,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-02-06 02:23:23,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-02-06 02:23:23,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:23,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 02:23:24,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:24,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25775181] [2025-02-06 02:23:24,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25775181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:24,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:24,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:23:24,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118821911] [2025-02-06 02:23:24,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:24,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:23:24,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:24,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:23:24,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:23:24,679 INFO L87 Difference]: Start difference. First operand 248 states and 393 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 02:23:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:25,060 INFO L93 Difference]: Finished difference Result 672 states and 1065 transitions. [2025-02-06 02:23:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:23:25,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 314 [2025-02-06 02:23:25,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:25,066 INFO L225 Difference]: With dead ends: 672 [2025-02-06 02:23:25,067 INFO L226 Difference]: Without dead ends: 427 [2025-02-06 02:23:25,068 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:23:25,069 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 323 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:25,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 892 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:23:25,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-02-06 02:23:25,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 260. [2025-02-06 02:23:25,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 209 states have (on average 1.492822966507177) internal successors, (312), 209 states have internal predecessors, (312), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 02:23:25,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 408 transitions. [2025-02-06 02:23:25,088 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 408 transitions. Word has length 314 [2025-02-06 02:23:25,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:25,089 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 408 transitions. [2025-02-06 02:23:25,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 02:23:25,089 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 408 transitions. [2025-02-06 02:23:25,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-02-06 02:23:25,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:25,092 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:25,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:23:25,092 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:25,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:25,093 INFO L85 PathProgramCache]: Analyzing trace with hash 440199369, now seen corresponding path program 1 times [2025-02-06 02:23:25,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:25,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431018287] [2025-02-06 02:23:25,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:25,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:25,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-02-06 02:23:25,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-02-06 02:23:25,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:25,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 02:23:25,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:25,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431018287] [2025-02-06 02:23:25,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431018287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:25,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:25,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:23:25,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151788583] [2025-02-06 02:23:25,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:25,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:23:25,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:25,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:23:25,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:23:25,792 INFO L87 Difference]: Start difference. First operand 260 states and 408 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 02:23:26,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:26,089 INFO L93 Difference]: Finished difference Result 762 states and 1202 transitions. [2025-02-06 02:23:26,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:23:26,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 314 [2025-02-06 02:23:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:26,093 INFO L225 Difference]: With dead ends: 762 [2025-02-06 02:23:26,095 INFO L226 Difference]: Without dead ends: 505 [2025-02-06 02:23:26,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:23:26,097 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 386 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:26,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 795 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:23:26,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-02-06 02:23:26,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 481. [2025-02-06 02:23:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 380 states have (on average 1.5) internal successors, (570), 380 states have internal predecessors, (570), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 02:23:26,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 762 transitions. [2025-02-06 02:23:26,147 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 762 transitions. Word has length 314 [2025-02-06 02:23:26,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:26,147 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 762 transitions. [2025-02-06 02:23:26,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 02:23:26,147 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 762 transitions. [2025-02-06 02:23:26,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-02-06 02:23:26,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:26,150 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:26,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:23:26,150 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:26,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:26,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1080551300, now seen corresponding path program 1 times [2025-02-06 02:23:26,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:26,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743832078] [2025-02-06 02:23:26,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:26,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:26,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-02-06 02:23:26,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-02-06 02:23:26,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:26,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 02:23:26,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:26,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743832078] [2025-02-06 02:23:26,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743832078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:26,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:26,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:23:26,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261084628] [2025-02-06 02:23:26,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:26,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:23:26,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:26,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:23:26,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:23:26,600 INFO L87 Difference]: Start difference. First operand 481 states and 762 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 02:23:27,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:27,750 INFO L93 Difference]: Finished difference Result 2631 states and 4172 transitions. [2025-02-06 02:23:27,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 02:23:27,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 314 [2025-02-06 02:23:27,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:27,763 INFO L225 Difference]: With dead ends: 2631 [2025-02-06 02:23:27,763 INFO L226 Difference]: Without dead ends: 2153 [2025-02-06 02:23:27,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:23:27,768 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 1178 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:27,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 2051 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:23:27,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2025-02-06 02:23:27,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 1790. [2025-02-06 02:23:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1790 states, 1442 states have (on average 1.5090152565880721) internal successors, (2176), 1448 states have internal predecessors, (2176), 330 states have call successors, (330), 17 states have call predecessors, (330), 17 states have return successors, (330), 324 states have call predecessors, (330), 330 states have call successors, (330) [2025-02-06 02:23:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2836 transitions. [2025-02-06 02:23:27,934 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2836 transitions. Word has length 314 [2025-02-06 02:23:27,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:27,936 INFO L471 AbstractCegarLoop]: Abstraction has 1790 states and 2836 transitions. [2025-02-06 02:23:27,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 02:23:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2836 transitions. [2025-02-06 02:23:27,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-02-06 02:23:27,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:27,942 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:27,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:23:27,942 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:27,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:27,943 INFO L85 PathProgramCache]: Analyzing trace with hash -750785539, now seen corresponding path program 1 times [2025-02-06 02:23:27,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:27,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756473643] [2025-02-06 02:23:27,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:27,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:27,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-02-06 02:23:28,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-02-06 02:23:28,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:28,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:28,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 02:23:28,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:28,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756473643] [2025-02-06 02:23:28,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756473643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:28,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:28,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:23:28,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778029297] [2025-02-06 02:23:28,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:28,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:23:28,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:28,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:23:28,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:23:28,961 INFO L87 Difference]: Start difference. First operand 1790 states and 2836 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 02:23:29,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:29,418 INFO L93 Difference]: Finished difference Result 3861 states and 6144 transitions. [2025-02-06 02:23:29,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:23:29,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 314 [2025-02-06 02:23:29,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:29,438 INFO L225 Difference]: With dead ends: 3861 [2025-02-06 02:23:29,439 INFO L226 Difference]: Without dead ends: 2951 [2025-02-06 02:23:29,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:23:29,443 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 249 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:29,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1272 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:23:29,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2025-02-06 02:23:29,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2883. [2025-02-06 02:23:29,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2883 states, 2379 states have (on average 1.5174443043295502) internal successors, (3610), 2391 states have internal predecessors, (3610), 478 states have call successors, (478), 25 states have call predecessors, (478), 25 states have return successors, (478), 466 states have call predecessors, (478), 478 states have call successors, (478) [2025-02-06 02:23:29,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2883 states and 4566 transitions. [2025-02-06 02:23:29,612 INFO L78 Accepts]: Start accepts. Automaton has 2883 states and 4566 transitions. Word has length 314 [2025-02-06 02:23:29,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:29,613 INFO L471 AbstractCegarLoop]: Abstraction has 2883 states and 4566 transitions. [2025-02-06 02:23:29,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 02:23:29,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 4566 transitions. [2025-02-06 02:23:29,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-02-06 02:23:29,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:29,618 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:29,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:23:29,619 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:29,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:29,620 INFO L85 PathProgramCache]: Analyzing trace with hash -57683842, now seen corresponding path program 1 times [2025-02-06 02:23:29,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:29,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836912260] [2025-02-06 02:23:29,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:29,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:29,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-02-06 02:23:29,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-02-06 02:23:29,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:29,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 02:23:39,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:39,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836912260] [2025-02-06 02:23:39,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836912260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:39,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:39,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:23:39,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961469960] [2025-02-06 02:23:39,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:39,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:23:39,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:39,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:23:39,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:23:39,355 INFO L87 Difference]: Start difference. First operand 2883 states and 4566 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 02:23:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:41,116 INFO L93 Difference]: Finished difference Result 6943 states and 10901 transitions. [2025-02-06 02:23:41,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:23:41,117 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 314 [2025-02-06 02:23:41,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:41,146 INFO L225 Difference]: With dead ends: 6943 [2025-02-06 02:23:41,146 INFO L226 Difference]: Without dead ends: 6009 [2025-02-06 02:23:41,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:23:41,155 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 446 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:41,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 1215 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 02:23:41,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2025-02-06 02:23:41,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 4683. [2025-02-06 02:23:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4683 states, 4119 states have (on average 1.5367807720320465) internal successors, (6330), 4146 states have internal predecessors, (6330), 508 states have call successors, (508), 55 states have call predecessors, (508), 55 states have return successors, (508), 481 states have call predecessors, (508), 508 states have call successors, (508) [2025-02-06 02:23:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4683 states to 4683 states and 7346 transitions. [2025-02-06 02:23:41,438 INFO L78 Accepts]: Start accepts. Automaton has 4683 states and 7346 transitions. Word has length 314 [2025-02-06 02:23:41,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:41,440 INFO L471 AbstractCegarLoop]: Abstraction has 4683 states and 7346 transitions. [2025-02-06 02:23:41,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 02:23:41,440 INFO L276 IsEmpty]: Start isEmpty. Operand 4683 states and 7346 transitions. [2025-02-06 02:23:41,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-02-06 02:23:41,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:41,444 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:41,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:23:41,445 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:41,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:41,445 INFO L85 PathProgramCache]: Analyzing trace with hash 2137447668, now seen corresponding path program 1 times [2025-02-06 02:23:41,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:41,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305418417] [2025-02-06 02:23:41,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:41,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:41,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-06 02:23:41,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-06 02:23:41,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:41,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:51,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 02:23:51,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:51,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305418417] [2025-02-06 02:23:51,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305418417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:51,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:51,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:23:51,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921025628] [2025-02-06 02:23:51,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:51,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:23:51,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:51,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:23:51,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:23:51,872 INFO L87 Difference]: Start difference. First operand 4683 states and 7346 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 02:23:54,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:54,823 INFO L93 Difference]: Finished difference Result 8789 states and 13741 transitions. [2025-02-06 02:23:54,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 02:23:54,824 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 315 [2025-02-06 02:23:54,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:54,853 INFO L225 Difference]: With dead ends: 8789 [2025-02-06 02:23:54,853 INFO L226 Difference]: Without dead ends: 7429 [2025-02-06 02:23:54,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:23:54,861 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 587 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:54,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1242 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 02:23:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7429 states. [2025-02-06 02:23:55,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7429 to 6024. [2025-02-06 02:23:55,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6024 states, 5370 states have (on average 1.5502793296089385) internal successors, (8325), 5412 states have internal predecessors, (8325), 568 states have call successors, (568), 85 states have call predecessors, (568), 85 states have return successors, (568), 526 states have call predecessors, (568), 568 states have call successors, (568) [2025-02-06 02:23:55,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6024 states to 6024 states and 9461 transitions. [2025-02-06 02:23:55,251 INFO L78 Accepts]: Start accepts. Automaton has 6024 states and 9461 transitions. Word has length 315 [2025-02-06 02:23:55,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:55,252 INFO L471 AbstractCegarLoop]: Abstraction has 6024 states and 9461 transitions. [2025-02-06 02:23:55,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 02:23:55,252 INFO L276 IsEmpty]: Start isEmpty. Operand 6024 states and 9461 transitions. [2025-02-06 02:23:55,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-02-06 02:23:55,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:55,258 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:55,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:23:55,259 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:55,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:55,259 INFO L85 PathProgramCache]: Analyzing trace with hash -360820911, now seen corresponding path program 1 times [2025-02-06 02:23:55,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:55,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034534131] [2025-02-06 02:23:55,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:55,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:55,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-06 02:23:55,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-06 02:23:55,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:55,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:23:55,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 02:23:55,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:23:55,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034534131] [2025-02-06 02:23:55,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034534131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:23:55,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:23:55,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:23:55,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108560946] [2025-02-06 02:23:55,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:23:55,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:23:55,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:23:55,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:23:55,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:23:55,399 INFO L87 Difference]: Start difference. First operand 6024 states and 9461 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 02:23:55,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:23:55,687 INFO L93 Difference]: Finished difference Result 11506 states and 18129 transitions. [2025-02-06 02:23:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:23:55,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 315 [2025-02-06 02:23:55,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:23:55,722 INFO L225 Difference]: With dead ends: 11506 [2025-02-06 02:23:55,722 INFO L226 Difference]: Without dead ends: 6690 [2025-02-06 02:23:55,733 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:23:55,734 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 71 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:23:55,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 519 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:23:55,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6690 states. [2025-02-06 02:23:56,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6690 to 6024. [2025-02-06 02:23:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6024 states, 5370 states have (on average 1.5424581005586593) internal successors, (8283), 5412 states have internal predecessors, (8283), 568 states have call successors, (568), 85 states have call predecessors, (568), 85 states have return successors, (568), 526 states have call predecessors, (568), 568 states have call successors, (568) [2025-02-06 02:23:56,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6024 states to 6024 states and 9419 transitions. [2025-02-06 02:23:56,086 INFO L78 Accepts]: Start accepts. Automaton has 6024 states and 9419 transitions. Word has length 315 [2025-02-06 02:23:56,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:23:56,087 INFO L471 AbstractCegarLoop]: Abstraction has 6024 states and 9419 transitions. [2025-02-06 02:23:56,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 02:23:56,088 INFO L276 IsEmpty]: Start isEmpty. Operand 6024 states and 9419 transitions. [2025-02-06 02:23:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-02-06 02:23:56,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:23:56,093 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:56,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:23:56,093 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:23:56,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:23:56,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1856937042, now seen corresponding path program 1 times [2025-02-06 02:23:56,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:23:56,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588123855] [2025-02-06 02:23:56,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:23:56,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:23:56,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-06 02:23:56,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-06 02:23:56,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:23:56,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:10,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 02:24:10,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:10,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588123855] [2025-02-06 02:24:10,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588123855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:24:10,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:24:10,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 02:24:10,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111055347] [2025-02-06 02:24:10,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:24:10,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 02:24:10,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:10,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 02:24:10,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:24:10,240 INFO L87 Difference]: Start difference. First operand 6024 states and 9419 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-06 02:24:13,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:13,137 INFO L93 Difference]: Finished difference Result 16001 states and 25051 transitions. [2025-02-06 02:24:13,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 02:24:13,137 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 315 [2025-02-06 02:24:13,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:13,175 INFO L225 Difference]: With dead ends: 16001 [2025-02-06 02:24:13,175 INFO L226 Difference]: Without dead ends: 14366 [2025-02-06 02:24:13,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-02-06 02:24:13,184 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 827 mSDsluCounter, 1436 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:13,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1792 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-06 02:24:13,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14366 states. [2025-02-06 02:24:13,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14366 to 11834. [2025-02-06 02:24:13,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11834 states, 10577 states have (on average 1.542686962276638) internal successors, (16317), 10661 states have internal predecessors, (16317), 1088 states have call successors, (1088), 168 states have call predecessors, (1088), 168 states have return successors, (1088), 1004 states have call predecessors, (1088), 1088 states have call successors, (1088) [2025-02-06 02:24:13,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11834 states to 11834 states and 18493 transitions. [2025-02-06 02:24:13,909 INFO L78 Accepts]: Start accepts. Automaton has 11834 states and 18493 transitions. Word has length 315 [2025-02-06 02:24:13,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:13,910 INFO L471 AbstractCegarLoop]: Abstraction has 11834 states and 18493 transitions. [2025-02-06 02:24:13,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-06 02:24:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 11834 states and 18493 transitions. [2025-02-06 02:24:13,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-02-06 02:24:13,919 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:13,919 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:13,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:24:13,920 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:13,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:13,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1668051676, now seen corresponding path program 1 times [2025-02-06 02:24:13,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:13,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263459260] [2025-02-06 02:24:13,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:13,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:13,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-02-06 02:24:14,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-02-06 02:24:14,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:14,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 42 proven. 99 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2025-02-06 02:24:15,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:15,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263459260] [2025-02-06 02:24:15,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263459260] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:24:15,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700561990] [2025-02-06 02:24:15,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:15,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:24:15,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:24:15,408 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:24:15,409 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:24:15,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-02-06 02:24:15,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-02-06 02:24:15,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:15,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:15,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 02:24:15,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:24:16,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1086 proven. 240 refuted. 0 times theorem prover too weak. 3186 trivial. 0 not checked. [2025-02-06 02:24:16,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:24:17,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 18 proven. 123 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2025-02-06 02:24:17,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700561990] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:24:17,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:24:17,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 24 [2025-02-06 02:24:17,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272286289] [2025-02-06 02:24:17,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:24:17,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 02:24:17,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:17,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 02:24:17,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2025-02-06 02:24:17,460 INFO L87 Difference]: Start difference. First operand 11834 states and 18493 transitions. Second operand has 24 states, 23 states have (on average 8.652173913043478) internal successors, (199), 23 states have internal predecessors, (199), 8 states have call successors, (144), 4 states have call predecessors, (144), 7 states have return successors, (144), 7 states have call predecessors, (144), 8 states have call successors, (144) [2025-02-06 02:24:21,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:24:21,418 INFO L93 Difference]: Finished difference Result 27654 states and 42741 transitions. [2025-02-06 02:24:21,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-02-06 02:24:21,418 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 8.652173913043478) internal successors, (199), 23 states have internal predecessors, (199), 8 states have call successors, (144), 4 states have call predecessors, (144), 7 states have return successors, (144), 7 states have call predecessors, (144), 8 states have call successors, (144) Word has length 316 [2025-02-06 02:24:21,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:24:21,528 INFO L225 Difference]: With dead ends: 27654 [2025-02-06 02:24:21,529 INFO L226 Difference]: Without dead ends: 15919 [2025-02-06 02:24:21,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 628 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=607, Invalid=2255, Unknown=0, NotChecked=0, Total=2862 [2025-02-06 02:24:21,544 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 2278 mSDsluCounter, 2687 mSDsCounter, 0 mSdLazyCounter, 2668 mSolverCounterSat, 588 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2285 SdHoareTripleChecker+Valid, 2927 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 588 IncrementalHoareTripleChecker+Valid, 2668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:24:21,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2285 Valid, 2927 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [588 Valid, 2668 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-06 02:24:21,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15919 states. [2025-02-06 02:24:22,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15919 to 14491. [2025-02-06 02:24:22,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14491 states, 12589 states have (on average 1.4965446024306934) internal successors, (18840), 12694 states have internal predecessors, (18840), 1554 states have call successors, (1554), 347 states have call predecessors, (1554), 347 states have return successors, (1554), 1449 states have call predecessors, (1554), 1554 states have call successors, (1554) [2025-02-06 02:24:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14491 states to 14491 states and 21948 transitions. [2025-02-06 02:24:22,547 INFO L78 Accepts]: Start accepts. Automaton has 14491 states and 21948 transitions. Word has length 316 [2025-02-06 02:24:22,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:24:22,548 INFO L471 AbstractCegarLoop]: Abstraction has 14491 states and 21948 transitions. [2025-02-06 02:24:22,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 8.652173913043478) internal successors, (199), 23 states have internal predecessors, (199), 8 states have call successors, (144), 4 states have call predecessors, (144), 7 states have return successors, (144), 7 states have call predecessors, (144), 8 states have call successors, (144) [2025-02-06 02:24:22,549 INFO L276 IsEmpty]: Start isEmpty. Operand 14491 states and 21948 transitions. [2025-02-06 02:24:22,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-02-06 02:24:22,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:24:22,556 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:22,565 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:24:22,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:24:22,757 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:24:22,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:24:22,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1032378463, now seen corresponding path program 1 times [2025-02-06 02:24:22,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:24:22,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106832868] [2025-02-06 02:24:22,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:24:22,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:24:22,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-02-06 02:24:22,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-02-06 02:24:22,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:24:22,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:24:33,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 02:24:33,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:24:33,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106832868] [2025-02-06 02:24:33,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106832868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:24:33,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:24:33,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:24:33,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398314682] [2025-02-06 02:24:33,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:24:33,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:24:33,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:24:33,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:24:33,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:24:33,449 INFO L87 Difference]: Start difference. First operand 14491 states and 21948 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48)