./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label18.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label18.c -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 2e51d75a8ad9c92226cf9c3e34cc8785c0e5af56e84d6fc07c305ea014e608b6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:45:29,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:45:29,972 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:45:29,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:45:29,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:45:29,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:45:29,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:45:29,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:45:29,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:45:29,990 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:45:29,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:45:29,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:45:29,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:45:29,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:45:29,990 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:45:29,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:45:29,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:45:29,991 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:45:29,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:45:29,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:45:29,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:45:29,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:45:29,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:45:29,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:45:29,991 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:45:29,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:45:29,991 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:45:29,992 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:45:29,992 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:45:29,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:45:29,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:45:29,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:45:29,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:45:29,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:45:29,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:45:29,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:45:29,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:45:29,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:45:29,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:45:29,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:45:29,993 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:45:29,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:45:29,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:45:29,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:45:29,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:45:29,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:45:29,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:45:29,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:45:29,993 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 -> 2e51d75a8ad9c92226cf9c3e34cc8785c0e5af56e84d6fc07c305ea014e608b6 [2025-01-08 23:45:30,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:45:30,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:45:30,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:45:30,235 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:45:30,235 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:45:30,238 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label18.c [2025-01-08 23:45:31,398 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44572539d/873cb0e085d64d19b96cb770114ce546/FLAGadd9e5952 [2025-01-08 23:45:31,897 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:45:31,897 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label18.c [2025-01-08 23:45:31,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44572539d/873cb0e085d64d19b96cb770114ce546/FLAGadd9e5952 [2025-01-08 23:45:31,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44572539d/873cb0e085d64d19b96cb770114ce546 [2025-01-08 23:45:31,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:45:31,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:45:31,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:45:31,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:45:31,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:45:31,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:45:31" (1/1) ... [2025-01-08 23:45:31,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f6ac75a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:31, skipping insertion in model container [2025-01-08 23:45:31,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:45:31" (1/1) ... [2025-01-08 23:45:32,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:45:32,187 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/eca-rers2012/Problem12_label18.c[6604,6617] [2025-01-08 23:45:32,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:45:32,618 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:45:32,637 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/eca-rers2012/Problem12_label18.c[6604,6617] [2025-01-08 23:45:32,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:45:32,895 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:45:32,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:32 WrapperNode [2025-01-08 23:45:32,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:45:32,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:45:32,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:45:32,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:45:32,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:32" (1/1) ... [2025-01-08 23:45:32,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:32" (1/1) ... [2025-01-08 23:45:33,159 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-01-08 23:45:33,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:45:33,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:45:33,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:45:33,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:45:33,167 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:32" (1/1) ... [2025-01-08 23:45:33,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:32" (1/1) ... [2025-01-08 23:45:33,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:32" (1/1) ... [2025-01-08 23:45:33,344 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 23:45:33,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:32" (1/1) ... [2025-01-08 23:45:33,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:32" (1/1) ... [2025-01-08 23:45:33,419 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:32" (1/1) ... [2025-01-08 23:45:33,430 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:32" (1/1) ... [2025-01-08 23:45:33,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:32" (1/1) ... [2025-01-08 23:45:33,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:32" (1/1) ... [2025-01-08 23:45:33,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:32" (1/1) ... [2025-01-08 23:45:33,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:45:33,541 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:45:33,541 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:45:33,541 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:45:33,542 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:32" (1/1) ... [2025-01-08 23:45:33,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:45:33,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:45:33,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:45:33,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:45:33,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:45:33,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:45:33,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:45:33,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:45:33,636 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:45:33,638 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:45:36,766 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-01-08 23:45:36,767 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:45:36,790 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:45:36,790 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:45:36,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:45:36 BoogieIcfgContainer [2025-01-08 23:45:36,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:45:36,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:45:36,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:45:36,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:45:36,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:45:31" (1/3) ... [2025-01-08 23:45:36,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e364865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:45:36, skipping insertion in model container [2025-01-08 23:45:36,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:32" (2/3) ... [2025-01-08 23:45:36,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e364865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:45:36, skipping insertion in model container [2025-01-08 23:45:36,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:45:36" (3/3) ... [2025-01-08 23:45:36,797 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label18.c [2025-01-08 23:45:36,807 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:45:36,808 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label18.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:45:36,862 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:45:36,869 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;@463edb92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:45:36,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:45:36,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:36,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-08 23:45:36,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:36,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:36,880 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:36,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:36,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1210903428, now seen corresponding path program 1 times [2025-01-08 23:45:36,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:36,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354612824] [2025-01-08 23:45:36,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:36,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:36,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-08 23:45:36,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-08 23:45:36,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:36,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:45:37,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:37,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354612824] [2025-01-08 23:45:37,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354612824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:37,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:37,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:45:37,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050751292] [2025-01-08 23:45:37,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:37,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:37,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:37,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:37,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:37,142 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:40,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:40,089 INFO L93 Difference]: Finished difference Result 2404 states and 4642 transitions. [2025-01-08 23:45:40,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:40,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-01-08 23:45:40,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:40,103 INFO L225 Difference]: With dead ends: 2404 [2025-01-08 23:45:40,103 INFO L226 Difference]: Without dead ends: 1506 [2025-01-08 23:45:40,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:40,111 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 767 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:40,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 525 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:45:40,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-01-08 23:45:40,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-01-08 23:45:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.6066445182724252) internal successors, (2418), 1505 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:40,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2418 transitions. [2025-01-08 23:45:40,205 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2418 transitions. Word has length 53 [2025-01-08 23:45:40,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:40,207 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2418 transitions. [2025-01-08 23:45:40,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:40,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2418 transitions. [2025-01-08 23:45:40,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-08 23:45:40,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:40,211 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:40,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:45:40,212 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:40,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:40,212 INFO L85 PathProgramCache]: Analyzing trace with hash -288111995, now seen corresponding path program 1 times [2025-01-08 23:45:40,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:40,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606183132] [2025-01-08 23:45:40,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:40,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:40,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-08 23:45:40,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-08 23:45:40,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:40,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:40,429 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:45:40,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:40,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606183132] [2025-01-08 23:45:40,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606183132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:40,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:40,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:45:40,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703693320] [2025-01-08 23:45:40,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:40,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:40,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:40,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:40,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:40,431 INFO L87 Difference]: Start difference. First operand 1506 states and 2418 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:42,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:42,876 INFO L93 Difference]: Finished difference Result 4512 states and 7249 transitions. [2025-01-08 23:45:42,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:42,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-01-08 23:45:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:42,885 INFO L225 Difference]: With dead ends: 4512 [2025-01-08 23:45:42,885 INFO L226 Difference]: Without dead ends: 3008 [2025-01-08 23:45:42,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:42,888 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 774 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:42,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 449 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:45:42,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2025-01-08 23:45:42,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3008. [2025-01-08 23:45:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.4156967076820752) internal successors, (4257), 3007 states have internal predecessors, (4257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:42,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4257 transitions. [2025-01-08 23:45:42,929 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4257 transitions. Word has length 128 [2025-01-08 23:45:42,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:42,930 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4257 transitions. [2025-01-08 23:45:42,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:42,930 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4257 transitions. [2025-01-08 23:45:42,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-08 23:45:42,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:42,936 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:42,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:45:42,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:42,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:42,937 INFO L85 PathProgramCache]: Analyzing trace with hash -2069990902, now seen corresponding path program 1 times [2025-01-08 23:45:42,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:42,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872059295] [2025-01-08 23:45:42,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:42,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:42,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-08 23:45:42,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-08 23:45:42,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:42,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:45:43,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:43,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872059295] [2025-01-08 23:45:43,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872059295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:43,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:43,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:45:43,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686567781] [2025-01-08 23:45:43,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:43,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:45:43,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:43,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:45:43,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:45:43,310 INFO L87 Difference]: Start difference. First operand 3008 states and 4257 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:46,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:46,880 INFO L93 Difference]: Finished difference Result 9769 states and 13601 transitions. [2025-01-08 23:45:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:45:46,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2025-01-08 23:45:46,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:46,909 INFO L225 Difference]: With dead ends: 9769 [2025-01-08 23:45:46,909 INFO L226 Difference]: Without dead ends: 6763 [2025-01-08 23:45:46,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:45:46,919 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 2182 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4712 mSolverCounterSat, 747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2182 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 5459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 747 IncrementalHoareTripleChecker+Valid, 4712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:46,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2182 Valid, 164 Invalid, 5459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [747 Valid, 4712 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-08 23:45:46,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2025-01-08 23:45:47,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6763. [2025-01-08 23:45:47,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6763 states, 6762 states have (on average 1.3510795622596865) internal successors, (9136), 6762 states have internal predecessors, (9136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:47,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6763 states to 6763 states and 9136 transitions. [2025-01-08 23:45:47,082 INFO L78 Accepts]: Start accepts. Automaton has 6763 states and 9136 transitions. Word has length 130 [2025-01-08 23:45:47,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:47,083 INFO L471 AbstractCegarLoop]: Abstraction has 6763 states and 9136 transitions. [2025-01-08 23:45:47,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:47,083 INFO L276 IsEmpty]: Start isEmpty. Operand 6763 states and 9136 transitions. [2025-01-08 23:45:47,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-08 23:45:47,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:47,085 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:47,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:45:47,085 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:47,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:47,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1099801258, now seen corresponding path program 1 times [2025-01-08 23:45:47,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:47,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716162298] [2025-01-08 23:45:47,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:47,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:47,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-08 23:45:47,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-08 23:45:47,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:47,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:47,302 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:45:47,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:47,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716162298] [2025-01-08 23:45:47,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716162298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:47,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:47,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:45:47,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257777880] [2025-01-08 23:45:47,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:47,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:47,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:47,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:47,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:47,305 INFO L87 Difference]: Start difference. First operand 6763 states and 9136 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:49,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:49,784 INFO L93 Difference]: Finished difference Result 15777 states and 21635 transitions. [2025-01-08 23:45:49,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:49,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2025-01-08 23:45:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:49,804 INFO L225 Difference]: With dead ends: 15777 [2025-01-08 23:45:49,804 INFO L226 Difference]: Without dead ends: 9767 [2025-01-08 23:45:49,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:49,809 INFO L435 NwaCegarLoop]: 1235 mSDtfsCounter, 707 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2693 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 3044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 2693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:49,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1243 Invalid, 3044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 2693 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:45:49,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2025-01-08 23:45:49,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2025-01-08 23:45:49,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.3334015973786606) internal successors, (13022), 9766 states have internal predecessors, (13022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:49,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 13022 transitions. [2025-01-08 23:45:49,902 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 13022 transitions. Word has length 194 [2025-01-08 23:45:49,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:49,903 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 13022 transitions. [2025-01-08 23:45:49,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:49,903 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 13022 transitions. [2025-01-08 23:45:49,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-08 23:45:49,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:49,905 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:49,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:45:49,905 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:49,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:49,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1937556044, now seen corresponding path program 1 times [2025-01-08 23:45:49,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:49,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010625434] [2025-01-08 23:45:49,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:49,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:49,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-08 23:45:49,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-08 23:45:49,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:49,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:50,076 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:45:50,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:50,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010625434] [2025-01-08 23:45:50,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010625434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:50,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:50,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:45:50,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933336748] [2025-01-08 23:45:50,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:50,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:50,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:50,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:50,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:50,079 INFO L87 Difference]: Start difference. First operand 9767 states and 13022 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:52,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:52,501 INFO L93 Difference]: Finished difference Result 18781 states and 25285 transitions. [2025-01-08 23:45:52,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:52,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2025-01-08 23:45:52,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:52,538 INFO L225 Difference]: With dead ends: 18781 [2025-01-08 23:45:52,541 INFO L226 Difference]: Without dead ends: 9767 [2025-01-08 23:45:52,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:52,552 INFO L435 NwaCegarLoop]: 1299 mSDtfsCounter, 737 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 3019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:52,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 1307 Invalid, 3019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:45:52,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2025-01-08 23:45:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2025-01-08 23:45:52,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.2981773499897604) internal successors, (12678), 9766 states have internal predecessors, (12678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:52,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 12678 transitions. [2025-01-08 23:45:52,663 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 12678 transitions. Word has length 198 [2025-01-08 23:45:52,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:52,664 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 12678 transitions. [2025-01-08 23:45:52,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 12678 transitions. [2025-01-08 23:45:52,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-08 23:45:52,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:52,666 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:52,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:45:52,667 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:52,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:52,667 INFO L85 PathProgramCache]: Analyzing trace with hash 349598530, now seen corresponding path program 1 times [2025-01-08 23:45:52,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:52,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752758501] [2025-01-08 23:45:52,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:52,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:52,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-08 23:45:52,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-08 23:45:52,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:52,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:52,960 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-08 23:45:52,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:52,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752758501] [2025-01-08 23:45:52,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752758501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:52,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:52,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:45:52,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545845243] [2025-01-08 23:45:52,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:52,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:45:52,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:52,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:45:52,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:45:52,964 INFO L87 Difference]: Start difference. First operand 9767 states and 12678 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:55,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:55,675 INFO L93 Difference]: Finished difference Result 22573 states and 29091 transitions. [2025-01-08 23:45:55,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:45:55,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2025-01-08 23:45:55,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:55,713 INFO L225 Difference]: With dead ends: 22573 [2025-01-08 23:45:55,713 INFO L226 Difference]: Without dead ends: 13522 [2025-01-08 23:45:55,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:45:55,733 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 688 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3695 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 3902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 3695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:55,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 628 Invalid, 3902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 3695 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:45:55,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13522 states. [2025-01-08 23:45:55,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13522 to 12771. [2025-01-08 23:45:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12771 states, 12770 states have (on average 1.2293657008613939) internal successors, (15699), 12770 states have internal predecessors, (15699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12771 states to 12771 states and 15699 transitions. [2025-01-08 23:45:55,863 INFO L78 Accepts]: Start accepts. Automaton has 12771 states and 15699 transitions. Word has length 207 [2025-01-08 23:45:55,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:55,863 INFO L471 AbstractCegarLoop]: Abstraction has 12771 states and 15699 transitions. [2025-01-08 23:45:55,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:55,864 INFO L276 IsEmpty]: Start isEmpty. Operand 12771 states and 15699 transitions. [2025-01-08 23:45:55,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-01-08 23:45:55,866 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:55,866 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:55,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:45:55,867 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:55,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:55,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1257170839, now seen corresponding path program 1 times [2025-01-08 23:45:55,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:55,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970954527] [2025-01-08 23:45:55,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:55,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:55,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-01-08 23:45:55,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-01-08 23:45:55,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:55,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 101 proven. 7 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-08 23:45:56,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:56,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970954527] [2025-01-08 23:45:56,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970954527] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:45:56,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241702552] [2025-01-08 23:45:56,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:56,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:45:56,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:45:56,166 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:45:56,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:45:56,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-01-08 23:45:56,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-01-08 23:45:56,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:56,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:56,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:45:56,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:45:56,385 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:45:56,388 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:45:56,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241702552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:56,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:45:56,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 23:45:56,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529773443] [2025-01-08 23:45:56,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:56,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:56,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:56,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:56,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:45:56,390 INFO L87 Difference]: Start difference. First operand 12771 states and 15699 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:58,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:58,921 INFO L93 Difference]: Finished difference Result 32299 states and 40603 transitions. [2025-01-08 23:45:58,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:58,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 281 [2025-01-08 23:45:58,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:58,951 INFO L225 Difference]: With dead ends: 32299 [2025-01-08 23:45:58,951 INFO L226 Difference]: Without dead ends: 20281 [2025-01-08 23:45:58,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:45:58,959 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 907 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:58,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 309 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:45:58,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20281 states. [2025-01-08 23:45:59,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20281 to 20281. [2025-01-08 23:45:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20281 states, 20280 states have (on average 1.192603550295858) internal successors, (24186), 20280 states have internal predecessors, (24186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20281 states to 20281 states and 24186 transitions. [2025-01-08 23:45:59,121 INFO L78 Accepts]: Start accepts. Automaton has 20281 states and 24186 transitions. Word has length 281 [2025-01-08 23:45:59,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:59,122 INFO L471 AbstractCegarLoop]: Abstraction has 20281 states and 24186 transitions. [2025-01-08 23:45:59,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:59,122 INFO L276 IsEmpty]: Start isEmpty. Operand 20281 states and 24186 transitions. [2025-01-08 23:45:59,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-01-08 23:45:59,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:59,125 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:59,132 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-01-08 23:45:59,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:45:59,326 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:59,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:59,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1733158337, now seen corresponding path program 1 times [2025-01-08 23:45:59,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:59,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485904354] [2025-01-08 23:45:59,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:59,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:59,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-01-08 23:45:59,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-01-08 23:45:59,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:59,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-01-08 23:45:59,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:59,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485904354] [2025-01-08 23:45:59,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485904354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:59,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:59,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:45:59,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539060260] [2025-01-08 23:45:59,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:59,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:59,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:59,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:59,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:59,501 INFO L87 Difference]: Start difference. First operand 20281 states and 24186 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:01,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:01,989 INFO L93 Difference]: Finished difference Result 57082 states and 68620 transitions. [2025-01-08 23:46:01,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:01,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 330 [2025-01-08 23:46:01,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:02,053 INFO L225 Difference]: With dead ends: 57082 [2025-01-08 23:46:02,053 INFO L226 Difference]: Without dead ends: 37554 [2025-01-08 23:46:02,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:02,072 INFO L435 NwaCegarLoop]: 1337 mSDtfsCounter, 740 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2179 mSolverCounterSat, 693 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 2872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 693 IncrementalHoareTripleChecker+Valid, 2179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:02,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 1345 Invalid, 2872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [693 Valid, 2179 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:46:02,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37554 states. [2025-01-08 23:46:02,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37554 to 34550. [2025-01-08 23:46:02,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34550 states, 34549 states have (on average 1.154534139917219) internal successors, (39888), 34549 states have internal predecessors, (39888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:02,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34550 states to 34550 states and 39888 transitions. [2025-01-08 23:46:02,366 INFO L78 Accepts]: Start accepts. Automaton has 34550 states and 39888 transitions. Word has length 330 [2025-01-08 23:46:02,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:02,367 INFO L471 AbstractCegarLoop]: Abstraction has 34550 states and 39888 transitions. [2025-01-08 23:46:02,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:02,367 INFO L276 IsEmpty]: Start isEmpty. Operand 34550 states and 39888 transitions. [2025-01-08 23:46:02,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-01-08 23:46:02,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:02,371 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:02,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:46:02,371 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:02,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:02,372 INFO L85 PathProgramCache]: Analyzing trace with hash -621759028, now seen corresponding path program 1 times [2025-01-08 23:46:02,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:02,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503550185] [2025-01-08 23:46:02,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:02,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:02,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-01-08 23:46:02,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-01-08 23:46:02,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:02,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:46:02,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:02,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503550185] [2025-01-08 23:46:02,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503550185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:02,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:02,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:02,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52284440] [2025-01-08 23:46:02,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:02,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:02,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:02,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:02,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:02,619 INFO L87 Difference]: Start difference. First operand 34550 states and 39888 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:04,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:04,922 INFO L93 Difference]: Finished difference Result 80363 states and 93219 transitions. [2025-01-08 23:46:04,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:04,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 352 [2025-01-08 23:46:04,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:05,103 INFO L225 Difference]: With dead ends: 80363 [2025-01-08 23:46:05,103 INFO L226 Difference]: Without dead ends: 46566 [2025-01-08 23:46:05,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:05,119 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 789 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 767 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 2842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 767 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:05,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 256 Invalid, 2842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [767 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:46:05,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46566 states. [2025-01-08 23:46:05,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46566 to 46566. [2025-01-08 23:46:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46566 states, 46565 states have (on average 1.120755932567379) internal successors, (52188), 46565 states have internal predecessors, (52188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:05,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46566 states to 46566 states and 52188 transitions. [2025-01-08 23:46:05,549 INFO L78 Accepts]: Start accepts. Automaton has 46566 states and 52188 transitions. Word has length 352 [2025-01-08 23:46:05,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:05,550 INFO L471 AbstractCegarLoop]: Abstraction has 46566 states and 52188 transitions. [2025-01-08 23:46:05,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:05,550 INFO L276 IsEmpty]: Start isEmpty. Operand 46566 states and 52188 transitions. [2025-01-08 23:46:05,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-01-08 23:46:05,553 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:05,554 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:05,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:46:05,554 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:05,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:05,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1265100491, now seen corresponding path program 1 times [2025-01-08 23:46:05,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:05,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133043921] [2025-01-08 23:46:05,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:05,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:05,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-01-08 23:46:05,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-01-08 23:46:05,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:05,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:05,951 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-08 23:46:05,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:05,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133043921] [2025-01-08 23:46:05,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133043921] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:46:05,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973246736] [2025-01-08 23:46:05,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:05,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:46:05,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:46:05,954 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:46:05,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:46:06,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-01-08 23:46:06,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-01-08 23:46:06,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:06,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:06,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:46:06,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:46:06,437 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-08 23:46:06,437 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:46:06,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973246736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:06,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:46:06,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-08 23:46:06,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011361259] [2025-01-08 23:46:06,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:06,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:06,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:06,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:06,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:46:06,438 INFO L87 Difference]: Start difference. First operand 46566 states and 52188 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:08,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:08,951 INFO L93 Difference]: Finished difference Result 113407 states and 127892 transitions. [2025-01-08 23:46:08,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:08,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 358 [2025-01-08 23:46:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:09,019 INFO L225 Difference]: With dead ends: 113407 [2025-01-08 23:46:09,019 INFO L226 Difference]: Without dead ends: 67594 [2025-01-08 23:46:09,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:46:09,051 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 484 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2288 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 2288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:09,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 507 Invalid, 2820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 2288 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:46:09,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67594 states. [2025-01-08 23:46:09,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67594 to 64590. [2025-01-08 23:46:09,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64590 states, 64589 states have (on average 1.1085169301274211) internal successors, (71598), 64589 states have internal predecessors, (71598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:09,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64590 states to 64590 states and 71598 transitions. [2025-01-08 23:46:09,660 INFO L78 Accepts]: Start accepts. Automaton has 64590 states and 71598 transitions. Word has length 358 [2025-01-08 23:46:09,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:09,660 INFO L471 AbstractCegarLoop]: Abstraction has 64590 states and 71598 transitions. [2025-01-08 23:46:09,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:09,660 INFO L276 IsEmpty]: Start isEmpty. Operand 64590 states and 71598 transitions. [2025-01-08 23:46:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-01-08 23:46:09,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:09,664 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:09,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 23:46:09,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:46:09,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:09,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash -2049228661, now seen corresponding path program 1 times [2025-01-08 23:46:09,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:09,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62014273] [2025-01-08 23:46:09,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:09,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:09,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-01-08 23:46:09,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-01-08 23:46:09,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:09,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-01-08 23:46:10,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:10,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62014273] [2025-01-08 23:46:10,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62014273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:10,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:10,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:10,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804926874] [2025-01-08 23:46:10,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:10,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:10,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:10,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:10,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:10,195 INFO L87 Difference]: Start difference. First operand 64590 states and 71598 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:13,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:13,218 INFO L93 Difference]: Finished difference Result 156214 states and 174439 transitions. [2025-01-08 23:46:13,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:13,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 383 [2025-01-08 23:46:13,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:13,316 INFO L225 Difference]: With dead ends: 156214 [2025-01-08 23:46:13,316 INFO L226 Difference]: Without dead ends: 92377 [2025-01-08 23:46:13,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:13,357 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 722 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2427 mSolverCounterSat, 533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 2960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 2427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:13,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 603 Invalid, 2960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 2427 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:46:13,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92377 states. [2025-01-08 23:46:14,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92377 to 89373. [2025-01-08 23:46:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89373 states, 89372 states have (on average 1.1061853824464039) internal successors, (98862), 89372 states have internal predecessors, (98862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89373 states to 89373 states and 98862 transitions. [2025-01-08 23:46:14,400 INFO L78 Accepts]: Start accepts. Automaton has 89373 states and 98862 transitions. Word has length 383 [2025-01-08 23:46:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:14,402 INFO L471 AbstractCegarLoop]: Abstraction has 89373 states and 98862 transitions. [2025-01-08 23:46:14,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:14,402 INFO L276 IsEmpty]: Start isEmpty. Operand 89373 states and 98862 transitions. [2025-01-08 23:46:14,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-01-08 23:46:14,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:14,413 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:14,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:46:14,417 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:14,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:14,417 INFO L85 PathProgramCache]: Analyzing trace with hash -86601860, now seen corresponding path program 1 times [2025-01-08 23:46:14,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:14,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644931642] [2025-01-08 23:46:14,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:14,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:14,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-01-08 23:46:14,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-01-08 23:46:14,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:14,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:15,045 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 336 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:46:15,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:15,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644931642] [2025-01-08 23:46:15,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644931642] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:46:15,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120324209] [2025-01-08 23:46:15,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:15,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:46:15,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:46:15,048 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:46:15,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 23:46:15,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-01-08 23:46:15,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-01-08 23:46:15,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:15,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:15,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:46:15,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:46:15,572 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-01-08 23:46:15,572 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:46:15,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120324209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:15,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:46:15,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:46:15,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905241781] [2025-01-08 23:46:15,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:15,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:46:15,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:15,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:46:15,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:46:15,573 INFO L87 Difference]: Start difference. First operand 89373 states and 98862 transitions. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:19,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:19,661 INFO L93 Difference]: Finished difference Result 247838 states and 275333 transitions. [2025-01-08 23:46:19,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:46:19,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 384 [2025-01-08 23:46:19,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:19,828 INFO L225 Difference]: With dead ends: 247838 [2025-01-08 23:46:19,828 INFO L226 Difference]: Without dead ends: 159218 [2025-01-08 23:46:19,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:46:19,869 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1875 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 4616 mSolverCounterSat, 565 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1875 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 565 IncrementalHoareTripleChecker+Valid, 4616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:19,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1875 Valid, 42 Invalid, 5181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [565 Valid, 4616 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-08 23:46:19,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159218 states. [2025-01-08 23:46:21,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159218 to 159216. [2025-01-08 23:46:21,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159216 states, 159215 states have (on average 1.1033256916747793) internal successors, (175666), 159215 states have internal predecessors, (175666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159216 states to 159216 states and 175666 transitions. [2025-01-08 23:46:21,648 INFO L78 Accepts]: Start accepts. Automaton has 159216 states and 175666 transitions. Word has length 384 [2025-01-08 23:46:21,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:21,652 INFO L471 AbstractCegarLoop]: Abstraction has 159216 states and 175666 transitions. [2025-01-08 23:46:21,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:21,652 INFO L276 IsEmpty]: Start isEmpty. Operand 159216 states and 175666 transitions. [2025-01-08 23:46:21,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-01-08 23:46:21,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:21,664 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:21,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 23:46:21,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:46:21,865 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:21,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:21,868 INFO L85 PathProgramCache]: Analyzing trace with hash -307488304, now seen corresponding path program 1 times [2025-01-08 23:46:21,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:21,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468199652] [2025-01-08 23:46:21,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:21,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:21,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-01-08 23:46:21,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-01-08 23:46:21,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:21,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:22,226 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 27 proven. 235 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-01-08 23:46:22,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:22,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468199652] [2025-01-08 23:46:22,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468199652] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:46:22,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915659200] [2025-01-08 23:46:22,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:22,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:46:22,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:46:22,233 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:46:22,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 23:46:22,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-01-08 23:46:22,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-01-08 23:46:22,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:22,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:22,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:46:22,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:46:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2025-01-08 23:46:22,583 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:46:22,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915659200] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:22,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:46:22,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:46:22,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832868971] [2025-01-08 23:46:22,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:22,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:22,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:22,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:22,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:46:22,584 INFO L87 Difference]: Start difference. First operand 159216 states and 175666 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:26,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:26,002 INFO L93 Difference]: Finished difference Result 361237 states and 400499 transitions. [2025-01-08 23:46:26,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:26,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 385 [2025-01-08 23:46:26,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:26,261 INFO L225 Difference]: With dead ends: 361237 [2025-01-08 23:46:26,261 INFO L226 Difference]: Without dead ends: 202774 [2025-01-08 23:46:26,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:46:26,322 INFO L435 NwaCegarLoop]: 1266 mSDtfsCounter, 692 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2316 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 2847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 2316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:26,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1274 Invalid, 2847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 2316 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:46:26,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202774 states. [2025-01-08 23:46:28,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202774 to 196766. [2025-01-08 23:46:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196766 states, 196765 states have (on average 1.0944781846364953) internal successors, (215355), 196765 states have internal predecessors, (215355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196766 states to 196766 states and 215355 transitions. [2025-01-08 23:46:28,764 INFO L78 Accepts]: Start accepts. Automaton has 196766 states and 215355 transitions. Word has length 385 [2025-01-08 23:46:28,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:28,764 INFO L471 AbstractCegarLoop]: Abstraction has 196766 states and 215355 transitions. [2025-01-08 23:46:28,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:28,764 INFO L276 IsEmpty]: Start isEmpty. Operand 196766 states and 215355 transitions. [2025-01-08 23:46:28,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-01-08 23:46:28,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:28,775 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:28,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-08 23:46:28,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-08 23:46:28,976 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:28,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:28,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1216117915, now seen corresponding path program 1 times [2025-01-08 23:46:28,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:28,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190103413] [2025-01-08 23:46:28,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:28,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:29,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-01-08 23:46:29,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-01-08 23:46:29,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:29,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:29,283 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 649 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2025-01-08 23:46:29,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:29,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190103413] [2025-01-08 23:46:29,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190103413] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:29,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:29,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:29,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018731189] [2025-01-08 23:46:29,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:29,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:29,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:29,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:29,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:29,285 INFO L87 Difference]: Start difference. First operand 196766 states and 215355 transitions. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:32,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:32,614 INFO L93 Difference]: Finished difference Result 405546 states and 443033 transitions. [2025-01-08 23:46:32,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:32,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 521 [2025-01-08 23:46:32,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:32,867 INFO L225 Difference]: With dead ends: 405546 [2025-01-08 23:46:32,867 INFO L226 Difference]: Without dead ends: 209533 [2025-01-08 23:46:32,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:32,916 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 663 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2283 mSolverCounterSat, 615 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 2898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 615 IncrementalHoareTripleChecker+Valid, 2283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:32,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 272 Invalid, 2898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [615 Valid, 2283 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:46:33,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209533 states. [2025-01-08 23:46:34,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209533 to 196766. [2025-01-08 23:46:34,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196766 states, 196765 states have (on average 1.0912814779051152) internal successors, (214726), 196765 states have internal predecessors, (214726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196766 states to 196766 states and 214726 transitions. [2025-01-08 23:46:35,155 INFO L78 Accepts]: Start accepts. Automaton has 196766 states and 214726 transitions. Word has length 521 [2025-01-08 23:46:35,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:35,155 INFO L471 AbstractCegarLoop]: Abstraction has 196766 states and 214726 transitions. [2025-01-08 23:46:35,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:35,156 INFO L276 IsEmpty]: Start isEmpty. Operand 196766 states and 214726 transitions. [2025-01-08 23:46:35,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-01-08 23:46:35,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:35,166 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:35,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:46:35,167 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:35,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:35,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1829712387, now seen corresponding path program 1 times [2025-01-08 23:46:35,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:35,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105856084] [2025-01-08 23:46:35,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:35,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:35,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-01-08 23:46:35,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-01-08 23:46:35,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:35,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 712 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-01-08 23:46:35,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:35,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105856084] [2025-01-08 23:46:35,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105856084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:35,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:35,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:35,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023915831] [2025-01-08 23:46:35,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:35,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:35,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:35,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:35,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:35,407 INFO L87 Difference]: Start difference. First operand 196766 states and 214726 transitions. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:38,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:38,580 INFO L93 Difference]: Finished difference Result 393530 states and 429451 transitions. [2025-01-08 23:46:38,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:38,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 537 [2025-01-08 23:46:38,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:38,819 INFO L225 Difference]: With dead ends: 393530 [2025-01-08 23:46:38,820 INFO L226 Difference]: Without dead ends: 197517 [2025-01-08 23:46:38,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:38,867 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 761 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2237 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 2636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 2237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:38,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 232 Invalid, 2636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 2237 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-08 23:46:38,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197517 states. [2025-01-08 23:46:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197517 to 196015. [2025-01-08 23:46:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196015 states, 196014 states have (on average 1.0801167263562808) internal successors, (211718), 196014 states have internal predecessors, (211718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:40,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196015 states to 196015 states and 211718 transitions. [2025-01-08 23:46:40,731 INFO L78 Accepts]: Start accepts. Automaton has 196015 states and 211718 transitions. Word has length 537 [2025-01-08 23:46:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:40,731 INFO L471 AbstractCegarLoop]: Abstraction has 196015 states and 211718 transitions. [2025-01-08 23:46:40,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:40,731 INFO L276 IsEmpty]: Start isEmpty. Operand 196015 states and 211718 transitions. [2025-01-08 23:46:40,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-01-08 23:46:40,741 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:40,742 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:40,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:46:40,742 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:40,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:40,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1460835123, now seen corresponding path program 1 times [2025-01-08 23:46:40,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:40,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104739218] [2025-01-08 23:46:40,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:40,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:40,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-01-08 23:46:40,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-01-08 23:46:40,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:40,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 689 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-01-08 23:46:40,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:40,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104739218] [2025-01-08 23:46:40,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104739218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:40,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:40,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:40,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10675022] [2025-01-08 23:46:40,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:40,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:40,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:40,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:40,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:40,898 INFO L87 Difference]: Start difference. First operand 196015 states and 211718 transitions. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:44,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:44,419 INFO L93 Difference]: Finished difference Result 396534 states and 428016 transitions. [2025-01-08 23:46:44,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:44,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 541 [2025-01-08 23:46:44,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:44,667 INFO L225 Difference]: With dead ends: 396534 [2025-01-08 23:46:44,668 INFO L226 Difference]: Without dead ends: 201272 [2025-01-08 23:46:44,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:44,731 INFO L435 NwaCegarLoop]: 999 mSDtfsCounter, 761 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:44,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1006 Invalid, 2633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:46:44,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201272 states. [2025-01-08 23:46:46,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201272 to 188505. [2025-01-08 23:46:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188505 states, 188504 states have (on average 1.0655954250307687) internal successors, (200869), 188504 states have internal predecessors, (200869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:46,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188505 states to 188505 states and 200869 transitions. [2025-01-08 23:46:46,662 INFO L78 Accepts]: Start accepts. Automaton has 188505 states and 200869 transitions. Word has length 541 [2025-01-08 23:46:46,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:46,662 INFO L471 AbstractCegarLoop]: Abstraction has 188505 states and 200869 transitions. [2025-01-08 23:46:46,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:46,663 INFO L276 IsEmpty]: Start isEmpty. Operand 188505 states and 200869 transitions. [2025-01-08 23:46:46,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2025-01-08 23:46:46,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:46,672 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:46,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 23:46:46,673 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:46,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:46,673 INFO L85 PathProgramCache]: Analyzing trace with hash 743456369, now seen corresponding path program 1 times [2025-01-08 23:46:46,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:46,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388657127] [2025-01-08 23:46:46,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:46,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:46,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes. [2025-01-08 23:46:46,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements. [2025-01-08 23:46:46,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:46,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 730 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-01-08 23:46:47,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:47,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388657127] [2025-01-08 23:46:47,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388657127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:47,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:47,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:47,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22065217] [2025-01-08 23:46:47,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:47,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:47,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:47,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:47,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:47,312 INFO L87 Difference]: Start difference. First operand 188505 states and 200869 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:50,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:50,688 INFO L93 Difference]: Finished difference Result 422068 states and 449236 transitions. [2025-01-08 23:46:50,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:50,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 549 [2025-01-08 23:46:50,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:50,984 INFO L225 Difference]: With dead ends: 422068 [2025-01-08 23:46:50,984 INFO L226 Difference]: Without dead ends: 234316 [2025-01-08 23:46:51,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:51,067 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 795 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 2729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:51,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 924 Invalid, 2729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 2140 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:46:51,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234316 states. [2025-01-08 23:46:53,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234316 to 211035. [2025-01-08 23:46:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211035 states, 211034 states have (on average 1.0569718623539335) internal successors, (223057), 211034 states have internal predecessors, (223057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:53,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211035 states to 211035 states and 223057 transitions. [2025-01-08 23:46:53,426 INFO L78 Accepts]: Start accepts. Automaton has 211035 states and 223057 transitions. Word has length 549 [2025-01-08 23:46:53,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:53,426 INFO L471 AbstractCegarLoop]: Abstraction has 211035 states and 223057 transitions. [2025-01-08 23:46:53,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:53,426 INFO L276 IsEmpty]: Start isEmpty. Operand 211035 states and 223057 transitions. [2025-01-08 23:46:53,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2025-01-08 23:46:53,436 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:53,436 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:53,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 23:46:53,436 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:53,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:53,437 INFO L85 PathProgramCache]: Analyzing trace with hash -950587674, now seen corresponding path program 1 times [2025-01-08 23:46:53,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:53,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777728557] [2025-01-08 23:46:53,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:53,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:53,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 559 statements into 1 equivalence classes. [2025-01-08 23:46:53,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 559 of 559 statements. [2025-01-08 23:46:53,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:53,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 748 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-01-08 23:46:54,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:54,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777728557] [2025-01-08 23:46:54,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777728557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:54,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:54,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:54,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410504983] [2025-01-08 23:46:54,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:54,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:54,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:54,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:54,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:54,331 INFO L87 Difference]: Start difference. First operand 211035 states and 223057 transitions. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)